#include <iostream>

#include <cstdio>

#include <queue>

#include <algorithm>

#include <cmath>

#include <cstring>

#define inf 2147483647

#define N 1000010

#define p(a) putchar(a)

#define For(i,a,b) for(long long i=a;i<=b;++i)

//by war

//2019.8.19

using namespace std;

long long n,cnt,ans1,ans2;//ans1是数的大小，ans2是因数个数

long long prime[N];

bool vis[N];

void in(long long &x){

    long long y=;char c=getchar();x=;

    while(c<''||c>''){if(c=='-')y=-;c=getchar();}

    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}

    x*=y;

}

void o(long long x){

    if(x<){p('-');x=-x;}

    if(x>)o(x/);

    p(x%+'');

}

void Euler(){

    For(i,,1e6){

        if(!vis[i]) prime[++cnt]=i;

        for(long long j=;j<=cnt&&i*prime[j]<=1e6;j++){

            vis[i*prime[j]]=;

            if(i%prime[j]==)

                break;

        }

    }

}

long long ksm(long long a,long long b){

    long long r=;

    while(b>){

        if(b&)

            r*=a;

        a*=a;

        b>>=;

    }

    return r;

}

void dfs(long long id,long long cnt,long long num,long long m){//第几个质数，指数，大小，因数个数

    if(m==ans2)

        ans1=min(ans1,num);

    if(m>ans2){

        ans1=num;

        ans2=m;

    }

    For(i,,cnt)

        if(ksm(prime[id],i)<=n&&num*ksm(prime[id],i)<=n)

            dfs(id+,i,num*ksm(prime[id],i),m*(+i));

        else

            return;

}

signed main(){

    Euler();

    while(cin>>n){

        ans1=;ans2=;

        For(i,,)

            if(((long long)<<i)<=n)

                dfs(,i,((long long)<<i),+i);

            else

                break;

        o(ans1);p('\n');//o(ans2);p('\n');

    }

    return ;

}