#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<vector>

 #include<bitset>

 using namespace std;

 #define fi first

 #define se second

 #define mp make_pair

 #define pb push_back

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<ll,ll> pll;

 const ll N=;

 ll n;

 ll prime[],len;

 pll ans;

 bool nprime[];

 void dfs(ll x,ll k,ll p,ll maxn)

 {

     if(ans.se<k||(ans.se==k&&ans.fi>x))    ans=pll(x,k);

     if(maxn==)    return;

     ll i,now=;

     for(i=;i<=maxn;i++)

     {

         if(now*x>n)    break;

         dfs(now*x,k*(i+),p+,i);

         now*=prime[p];

     }

 }

 int main()

 {

     ll i,j;

     scanf("%lld",&n);

     for(i=;i<=N;i++)

     {

         if(!nprime[i])    prime[++len]=i;

         for(j=;j<=len&&i*prime[j]<=N;j++)

         {

             nprime[i*prime[j]]=;

             if(i%prime[j]==)    break;

         }

     }

     dfs(,,,);

     printf("%lld",ans.fi);

     return ;

 }