#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; vector sieve(int n) { vector p(n);p[2]=2; for(int i=3;i> n; vector p=sieve(n+1); ll d[p.size()],ans=0; mem(d); REP(x,2,n+1) { set s; vector g; rep(i,p.size()) { if(x%p[i]==0) g.pb(i); } rep(i,g.size()) s.in(d[g[i]]); int sum=0; tr(it,s) sum+=*it; if(x>=sum) { rep(i,g.size()) d[g[i]]=x; ans+=x-sum; } } pr(ans); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}