#include <bits/stdc++.h>

using namespace std;

vector <int> prime = {2,3,5,7,11,13,17,19,23,29,31};
int dp[1301][1<<11];
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int N;
	
	cin >> N;
	
	for(int i=0;i<=N;i++)
	{
		for(int j=0;j<(1<<11);j++)
		{
			dp[i][j] = -1e9;
		}
	}
	
	dp[1][0] = 0;
	
	for(int i=1;i<N;i++)
	{
		int bitmask = 0;
		for(int j=0;j<prime.size();j++)
		{
			if(((i+1)%prime[j])==0)
			{
				bitmask += (1<<j);
			}
		}
		//cout << i+1 << ' ' << bitmask << '\n';
		for(int j=0;j<(1<<11);j++)
		{
			if(dp[i][j]<=-1e9) continue;
			dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
			if((j&bitmask)) continue;
			dp[i+1][bitmask + j] = max(dp[i+1][bitmask + j],dp[i][j] + (i+1));
		}
	}
	
	int res = 0;
	
	for(int j=0;j<(1<<11);j++)
	{
		res = max(res,dp[N][j]);
	}
	
	cout << res << '\n';
	
	return 0;
}