#include <iostream>

#include <cstring>

#include <algorithm>

#include <cstdio>

using namespace std;

#define pb push_back

#define ll long long

#define INF 0x3f3f3f3f

#define N 2000000000

ll n;

ll res;

ll fac;

ll prime[]={,,,,,,,,,};

void dfs(ll x,ll y,ll z,ll last)

{

    if(x>=){

        if(z>fac) res=y,fac=z;

        if(z==fac && y<res) res=y,fac=z;

        return;

    }

    for(ll i=;i<=last;i++){

        if(y>n) break;

        dfs(x+,y,z*(i+),i);

        y*=prime[x];

    }

}

int main()

{

    while(scanf("%lld",&n)!=EOF)

    {

        res=fac=;

        dfs(,,,INF);

        cout<<res<<endl;

    }

    return ;

}