1 #include<cstdio>
 2 #include<iostream>
 3 #include<algorithm>
 4 #include<cmath>
 5 #include<cstring>
 6 #include<cstdlib>
 7 #include<cctype>
 8 #include<stack>
 9 #include<queue>
10 #include<vector>
11 using namespace std;
12 #define enter puts("")
13 #define space putchar(' ')
14 #define Mem(a, x) memset(a, x, sizeof(a))
15 #define rg register
16 typedef long long ll;
17 typedef double db;
18 const int INF = 0x3f3f3f3f;
19 const db eps = 1e-8;
20 //const int maxn = ;
21 inline ll read()
22 {
23   ll ans = 0;
24   char ch = getchar(), las = ' ';
25   while(!isdigit(ch)) las = ch, ch = getchar();
26   while(isdigit(ch)) ans = ans * 10 + ch - '0', ch = getchar();
27   if(las == '-') ans = -ans;
28   return ans;
29 }
30 inline void write(ll x)
31 {
32   if(x < 0) putchar('-'), x = -x;
33   if(x >= 10) write(x / 10);
34   putchar(x % 10 + '0');
35 }
36
37 ll n;
38 const int a[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; //num = 10
39 ll ans1 = 0, ans = (ll)INF * (ll)INF;
40
41 void dfs(ll now, int id, int sum, int Max, int tot, ll x)
42 {
43   if(!tot || now > n || id > 11) return;
44   if(x > ans1 ||(x == ans1 && now < ans)) ans1 = x, ans = now;
45   ll tp = 1;
46   for(int i = 1; i <= min(tot, Max); ++i)
47     {
48       tp *= a[id];
49       if(tp > n) break;
50       dfs(now * tp, id + 1, sum + i, i, tot - i, x * (i + 1));
51     }
52 }
53
54 int main()
55 {
56   n = read();
57   dfs(1, 1, 0, INF, 30, 1);
58   write(ans);
59   return 0;
60 }