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>
using namespace std;
vector<int>v[100005];
map<pair<int,int>,int>m;
int vise[2000000]={};
int main(){
	int cnt = 0;
	int n;
	cin >> n;
	int idx = 1;
	for(int i = 2; i <= n; i++){
		for(int j = i+i; j <= n; j += i){
			m[make_pair(i,j)] = idx;
			m[make_pair(j,i)] = idx++;
			v[i].push_back(j);
			v[j].push_back(i);
			cnt++;
		}
	}
	cout<<cnt;
	int vis[n+5]={};
	long long ans = 0;
	for(int i = 2; i <= n; i++){
		if(vis[i] == 0){
			long long sum = 0;
			queue<int>q;
			q.push(i);
			vis[i] = 1;
			while(!q.empty()){
				int x = q.front();
				q.pop();
				for(int j = 0; j < v[x].size(); j++){
					int y = v[x][j];
					if(vis[y] == 0){
						vis[y] = 1;
						q.push(y);
					}
					if(vise[m[make_pair(x,y)]] == 1)continue;
					vise[m[make_pair(x,y)]] = 1;
					if(y > x){
						sum += y/x;
					}else sum += x/y;
				}
			}
			ans = max(ans, sum*4);
		}
	}
	cout<<ans;
	
}