#include "bits/stdc++.h"
 
using i64 = long long;
 
constexpr i64 prime[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
 
i64 n, ansNum, ansDiv;
 
void dfs(i64 num, i64 div, i64 now) {
    if (num > n || now > 10) 
        return;
    if (div > ansDiv) 
        ansDiv = div, ansNum = num;
    if (div == ansDiv && num < ansNum) 
        ansNum = num;
 
    for (i64 i = 1; num <= n; ++ i) {
        num *= prime[now];
        dfs(num, div * (1 + i), now + 1);
    }
}

int main() {
    freopen("ant.in", "r", stdin); 
    freopen("ant.out", "w", stdout);
    
    std::cin >> n;
 
    dfs(1, 1, 0);
 
    std::cout << ansNum << '\n';
    return 0;
}