#include using namespace std; using ll = long long; using ld = long double; using pll = pair; using vl = vector; template using vec = vector; template using vv = vec>; template using vvv = vv>; template using minpq = priority_queue, greater>; #define rep(i, r) for(ll i = 0; i < (r); i++) #define reps(i, l, r) for(ll i = (l); i < (r); i++) #define rrep(i, l, r) for(ll i = (r) - 1; i >= (l); i--) #define all(a) (a).begin(), (a).end() #define sz(a) (ll)(a).size() template bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; } template bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; } ll modmul(ll a, ll b, ll mod) { ll ret = a * b - mod * ll(1.L / mod * a * b); return ret + mod * (ret < 0) - mod * (ret >= mod); } ll modpow(ll a, ll b, ll mod) { ll ans = 1; for (; b; a = modmul(a, a, mod), b /= 2) if (b & 1) ans = modmul(ans, a, mod); return ans; } using ull = unsigned long long; int solve() { ll n; cin >> n; vec is_prime(100'001, true); is_prime[0] = false; is_prime[1] = false; for(ll p=2; p*p<=n; p++) { if(!is_prime[p]) continue; for(ll x=p*2; x<100'001; x+=p) { is_prime[x] = false; } } ll ans = 0; reps(p, 2, 100'001) { if(!is_prime[p]) continue; ll tmp = p * p; while(true) { if(tmp <= n) { ans += tmp; // cout << tmp << endl; tmp *= p; } else break; } } cout << ans << endl; return 0; } int main() { ll T = 1; cout << fixed << setprecision(16); // cin >> T; while (T--) solve(); }