28237
 13190
 39914
 81367
 8554
 61106
 67448
 39004
 22308
 16054
 71468
 60501
 100
 300
 59632
 90783
 5611
 1000
 69475
 69753
 10
 5
 582
 8
 36961
 5071
 20
 53213
 92775
 28738
 100000
 92280
 37944
 9
 2627
 7
 3

1028306548 224346172 2054738392 8539207488 94344524 4816051228 5867563092 1962150044 641839188 332342852 6587875268 4721174212 12600 115440 4586497300 10630118936 40580456 1286328 6225539588 6275533596 92 8 434692 52 1762017168 33141852 440 3652070664 11101694484 1065137992 12898363344 10983871880 1856988304 64 8885348 28 0
#include <bits/stdc++.h>
 
#define ll          long long
#define pb          push_back
#define mp          make_pair
#define pii         pair<int,int>
#define vi          vector<int>
#define vll         vector<ll>
#define all(a)      (a).begin(),(a).end()
#define lol         1000000007
#define rep(i,a,b)	for(int i=a;i<b;i++)
#define rev(i,a,b)	for(int i=b-1;i>=a;i--)
#define SIZE        1000005
#define debug(x)    cerr << #x << " = " << x << endl;
#define F 			first
#define S 			second
#define endl        '\n'
#define deci(n) 	cout<<fixed<<setprecision(n);
const double 		pi=acos(-1.0);


using namespace std;

void MOD(ll &x)
{
	if (x >= lol) x -= lol;
	if (x < 0) x += lol;
}

ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }




void solve()
{
	int n;
	cin>>n;
	ll dp[n+1] = {0};
	rep(i,2,n)
	{
		for (int j = i; j <= n; j+=i)
		{
			int k = j/i;
			ll temp = (ll)k*((ll)k+1)*2;
			temp -= 4;
			dp[j] += temp;
		}
		// if(n%i) continue;
		// int j = n/i;
		// ll temp = (ll)j*((ll)j+1)*2;
		// temp -= 4;
		// ans += temp;
	}
	// cout<<dp[n]<<" ";
	ll ans = 0;
	rep(i,1,n+1) cout<<dp[i]<<" ";
	rep(i,1,n+1) ans = max(ans, dp[i]);
	cout<<ans;
	
	
}

/* 
* (Actually read this pls -_-)
    * Really bad errors: int overflow (use ll), array bounds
    * Less bad errors: special cases (n=1?), set tle
    * Don't forget to sort the array
    * Common sense: do something instead of nothing, you are smarter than you think you are.
    * Remove debugs
*/

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
//	#ifndef ONLINE_JUDGE
//	    freopen("input.txt", "r", stdin);
//	    freopen("output.txt", "w", stdout);
//	#endif
	int t=1;
//	cin>>t; int i=1;
	while(t--){
		//cout<<"Case #"<<i++<<": ";
		solve();
  	  	//cout<<endl;	
  	}
	return 0;
}