bzoj1053

#include<bits/stdc++.h>
using namespace std;
const int p[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31}; 
int n, ans = 1, c = 1;
void dfs(int k, long long tot, long long cnt) {
    if(k == 12) {
        return;
    }
    if(tot < ans && cnt >= c) {
        c = cnt;
        ans = tot;
    }
    if(tot > ans && cnt > c) {
        c = cnt;
        ans = tot;
    }
    long long t = p[k];
    for(int i = 1; i <= 20; ++i) {
        if(tot * t <= n) {
            dfs(k + 1, tot * t, cnt * (i + 1));
        } else {
            break;
        }
        t *= p[k];
    }
}
int main() {
    scanf("%d", &n);
    dfs(1, 1, 1);
    printf("%d\n", ans);
    return 0;
}