#include <cstdio>
#include <iostream>
#include <string>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
long long int n;
long long int find(long long int x)
{
    long long int l=2,r=n,mid,i;
    while(l<=r)
    {
        //cout<<mid<<endl;
        mid=(l+r)/2;
        long long int sum=1;
        long long int ans=0;
        for(i=1; i<=x; i++)
        {
            if(n/sum<mid)
            {
                ans=n+1;
                break;
            }
            sum*=mid;;
            ans+=sum;
            if(ans>n)
                break;
        }
        if(ans==n||ans==n-1)
            return mid;
        else
        {
            if(ans<n-1)
                l=mid+1;
            else
                r=mid-1;
        }
    }
    return -1;

}
int main()
{
    //cin>>n;
    while(cin>>n)
    {
        //long long int minn=n-1;
       /* if(n==1)
        {
            cout<<0<<" "<<1<<endl;
            continue;
        }*/
        long long int r=1,k=n-1,i;
        for(i=2; i<=45; i++)
        {
            long long int t=find(i);
          //  cout<<t<<" "<<i<<endl;
            if(t==-1)
                continue;
            if(t*i<k*r)
            {
             //   minn=t*i;
                r=i;
                k=t;
            }
        }
        cout<<r<<" "<<k<<endl;
    }
    return 0;
}