//In the name of God

include <bits stdc++.h="">

using namespace std; typedef long long ll; vector<ll> val; vector<ll> add; const int Maxn = 1e6 + 9; const ll Mod = 1LL << 32; int phi[Maxn]; bool isp(ll x) { for(int i = 2; (ll)i * i <= x;i++) { if(x % i == 0) return 0; } return 1; } bool mul(ll x,ll y,ll n) { if(x > 1e6 && y > 1e6) return 0; if(x * y > n) return 0; return 1; } ll is(int x) { for(int i = 2; i <= 5;i++) { while(x % i == 0) x /= i; } return x; } int main() { ll n = 100; // cin >> n; ll tw = 1; for(int i = 0; i < 43;i++) { ll th = 1; if(tw > n) break; for(int j = 0; j < 43;j++) { ll fi = 1; if(tw * th > n) break; for(int k = 0; k < 43;k++) { if(fi * tw * th > n) break; val.push_back(fi * tw * th); fi *= 5; } th *= 3; } tw *= 2; } // for(int i = 1; i <= n;i++) phi[i] = i; // for(int i = 2; i <= n;i++) { // if(phi[i] == i) { // for(int j = i; j <= n;j+=i) { // phi[j] -= phi[j] / i; // } // } // } sort(val.begin(),val.end()); for(int i = 0; i < val.size();i++) { ll cur = val[i]; if(isp(cur + 1) && cur + 1 != 2 && cur + 1 != 3 && cur + 1 != 5) { add.push_back(cur + 1); } } for(int i = add.size() - 1; i + 1;i--) { vector<ll> v; for(int j = 0; j < val.size();j++) { if(!mul(add[i],val[j],n)) continue; v.push_back(add[i] * val[j]); } for(int j = 0; j < v.size();j++) val.push_back(v[j]); } ll ans = 0; for(int i = 0; i < val.size();i++) { ans += val[i] % Mod; ans %= Mod; continue; if(is(phi[val[i]]) != 1) { cout << val[i] <<' ' << phi[val[i]] << ' ' << is(phi[val[i]]) << '\n'; } else { } } cout << ans << endl; }