#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

int n,ans,mx,pri[]={,,,,,,,,,};

void dfs(int ps,int cnt,int lst,ll w)//注意w是ll

{

    if(cnt>mx)mx=cnt,ans=(int)w;

    else if(cnt==mx)ans=min(ans,(int)w);

    if(ps>)return;//

    for(int i=;i<=lst&&w<=n;i++,w*=pri[ps])

        dfs(ps+,cnt*(i+),i,w);

}

int main()

{

    scanf("%d",&n);

    dfs(,,,);

    printf("%d\n",ans);

    return ;

}