#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N; ll sqn = sqrt(N); ll result = 0; repr(i,1,sqn+1) { ll l = max(sqn+1,N/(i+1)+1), r = N/i; ll s1 = i*(r-l+1), s2 = ((N-i*l)+(N-i*r))%MOD*(r-l+1)%MOD*inv(2)%MOD; // cout << l << "-" << r << " " << s1 << "," << s2 << endl; result = (result+(s1+s2)) % MOD; } repr(i,2,sqn+1) { ll tn = N, sum = 0; while (tn) { sum+=tn%i; tn/=i; } result = (result+sum) % MOD; } cout << result << endl; return 0; }