一个问题

int n;
int ans;
int a[20]={0,2,3,5,7,11,13,17,19,23,29/*10*/,31,37,41,43,47,53,59,61,67};
void dfs(int now,int num,int res){
	if(now>15) return ans=max(ans,res),void();
	int cnt=1,k=a[now];
	while(1){
		if(num*k<=n) dfs(now+1,num*k,res*(cnt+1));
		else{
			dfs(16,num,res);
			break;
		}
		k*=a[now];
		cnt++;
	}
}
signed main(){
	n=read();
	dfs(1,1,1);
	write(ans);
    return 0;
}