#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}

signed main()
{
	int n=read(),ans=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;i*j<=n;j++)
		{
			ans+=n/i/j;
		}
	}
	cout<<ans<<endl;
	return 0;
}



#include<bits/stdc++.h> 
using namespace std;
#define int long long int 
#define endl '\n'

int countConsecutive(int N) 
{ 
    int count = 0; 
    for (int L = 1; L * (L + 1) < 2 * N; L++) 
    { 
        double a = (1.0 * N-(L * (L + 1)) / 2) / (L + 1); 
        if (a-(int)a == 0.0)  
            count++;         
    } 
    return count; 
} 

int32_t main() 
{ 
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
    
    int N;
    cin >> N;
    cout << 2+2*countConsecutive(N) << endl;
    
    return 0; 
}   