LL Solve(int level, LL n)
{
    LL l = 2, r = (LL)pow(n, 1.0/level);
    while (l <= r)
    {
        LL mid = MID(l, r);
        LL cur = 1, sum = 0;
        for (int i = 1; i <= level; i++)
        {
            cur *= mid;
            sum += cur;
            if (sum > n) break;
        }
        if (sum == n) return mid;
        else if (sum > n) r = mid-1;
        else l = mid+1;
    }
    return 0;
}
 
int main()
{
    //ROP;
    LL n;
    while (~scanf("%lld", &n))
    {
        LL ansr, ansk, ans = (1ll<<62);
        for (int r = 1; r <= 40; r++)
        {
            LL tmp = Solve(r, n);
            if (tmp && ans > tmp*r)
            {
                ans = tmp*r;
                ansr = r, ansk = tmp;
            }
            tmp = Solve(r, n-1);
            if (tmp && ans > tmp*r)
            {
                ans = tmp*r;
                ansr = r, ansk = tmp;
            }
        }
        printf("%lld %lld\n", ansr, ansk);
    }
    return 0;
}