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;
const int N = 1e5 + 5;
vector<int> fac[N];
int n, vis[N], weight[N];
long long ans;
set<int> s;
void dfs(int v) {
  if (vis[v]) return;
  s.insert(v);
  vis[v] = 1;
  for (int u : fac[v]) dfs(u);
  for (int u = 2 * v; u <= n; u += v) dfs(u);
}
int main() {
  cin >> n;
  for (int i = 2; i <= n; ++i)
    for (int j = 2 * i; j <= n; j += i) {
      fac[j].push_back(i);
      weight[j] += j / i;
    }
  for (int i = 2; i <= n; ++i)
    if (!vis[i]) {
      dfs(i);
      long long res = 0;
      for (auto x : s) {
        res += weight[x];
      }
      ans = max(ans, res);
      s.clear();
    }
  cout << 4 * ans << "\n";
  return 0;
}
