#include <bits/stdc++.h>
using namespace std;
class factor{
    int size;
    vector<int> primes;
    vector<int> lp;
public:
    explicit factor(int n): size(n){
        lp.assign(n+1,-1);
        for(int i=2;i<=n;i++){
            if(lp[i]==-1){
                primes.push_back(i);
                lp[i]=i;
            }
            for(int j=0;primes[j]<=lp[i]&&primes[j]*i<=n&&j<static_cast<int>(primes.size());j++){
                lp[primes[j]*i]=primes[j];
            }
        }
    }
    vector<pair<int,int> > get(int n){
        vector<pair<int,int> > ans;
        while(n>1){
            int p=lp[n];
            int cnt=0;
            while(n%p==0){
                cnt++;
                n/=p;
            }
            ans.emplace_back(p,cnt);
        }
        return ans;
    }
    long long numdivisors(int n){
        long long ans=1LL;
        while(n>1){
            int p=lp[n];
            int cnt=0;
            while(n%p==0){
                cnt++;
                n/=p;
            }
            ans*=cnt+1;
        }
        return ans;
    }
};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int k;
    cin>>k;
    factor Taha(2*100000+1);
    long long ans=0LL;
    for(int div=1;div<=k;div++){
        ans+=Taha.numdivisors(div)*(k/div);
    }
    cout<<ans;
    return 0;
}



#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')
            f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+(c^48);
        c=getchar();
    }
    return x*f;
}
const int maxn=1e5+7,moe=1e9+7;
int a[maxn],n,m,p[maxn],le=1,t[maxn];
signed main(){
	a[1]=1,a[2]=1;
	n=read();
	for(m=3;m<=130;m++){
		a[m]=a[m-1]+a[m-2];
		if(a[m]>n)
		break;
	}
	for(rint i=m-1;i>=1;i--){
		if(a[i]<=n){
			n-=a[i];
			p[++p[0]]=i;
		}
	}
	for(rint i=1;i<p[1];i++){
		if(p[1]-i+1==p[le]){
			le++;
			if(p[1]%2==0){
			if(i%2!=0)
			t[++t[0]]=2;
			else
			t[++t[0]]=1;
			}else{
			if(i%2!=0)
			t[++t[0]]=1;
			else
			t[++t[0]]=2;
			}
		}
		if(p[1]%2==0){
		if(i%2!=0)
			t[++t[0]]=3;
		else
			t[++t[0]]=4;
		}else{
		if(i%2!=0)
			t[++t[0]]=4;
		else
			t[++t[0]]=3;
		}
	}
	for(rint i=0;i<=t[0];i++)
	printf("%lld\n",t[i]);
    return 0;
}