#include <bits/stdc++.h>

int p[10] = {0 , 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23};
int n,ans,val,sum[10];

void get(int x,int y) {
	if(x > ans)ans = x,val = y;
	else if(x == ans)val = std::min(val , y);
}

void dfs(int x) {
	if(x > n / 2) {
		int cnt = 1;
		for(int i = 1;i <= 9;++ i)cnt *= (sum[i] + 1);
		get(cnt , x);
		return ;
	}
	for(int i = 1;i <= 9;++ i) {
		if(x <= n / p[i])
			++ sum[i],dfs(x * p[i]),-- sum[i];
	}
	return ;
}

int main() {
	freopen("ant.in","r",stdin);
	freopen("ant.out","w",stdout);
	scanf("%d",&n);
	dfs(1);
	printf("%d\n",val);
	return 0;
}