#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

mint ans = 0;
long long N;

void go(long long a,long long b,long long n){
	a+=b;
	mint temp = a;
	temp *= n;
	temp /= 2;
	ans += temp;
}

void check(long long now){
	while(now<=N){
		long long ok = now;
		long long ng = N+1;
		while(ng-ok>1){
			long long mid = (ok+ng)/2;
			if(N/now != N/mid)ng = mid;
			else ok = mid;
		}
		long long cnt = ok-now+1;
		mint temp = N/now;
		temp *= cnt;
		ans += temp;
		go(N%now,N%ok,cnt);
		now = ok+1;
	}
}

int main(){	
	
	
	cin>>N;
	
	for(long long i=2;true;i++){
		if(i*i>N){
			check(i);
			break;
		}
		else{
			long long temp = N;
			while(temp!=0){
				ans += temp%i;
				temp /= i;
			}
		}
	}
	
	cout<<ans.val()<<endl;
	
    return 0;
}