#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

#define UQns(v) v.erase(unique(ALL(v)), v.end())
#define UQ(v) sort(ALL(v)); UQns(v)

int n;
vector<int> v, w;

int main() {
	cin >> n;
	
	decII(i, 2, n) {
		w = v;
		inc(j, v.size()) {
			while(gcd(i, v[j]) != 1) { v[j] /= gcd(i, v[j]); }
		}
		v.PB(i);
		UQ(v);
		
		int vs = 0, ws = 0;
		inc(j, v.size()) { vs += (v[j] == 1 ? 0 : v[j]); }
		inc(j, w.size()) { ws += (w[j] == 1 ? 0 : w[j]); }
		if(vs >= ws) { } else { v = w; }
		
		// inc(i, v.size()) { cout << v[i] << " "; } cout << endl;
	}
	
	int s = 0;
	inc(i, v.size()) { s += (v[i] == 1 ? 0 : v[i]); }
	
	cout << s << endl;
	
	return 0;
}