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 MAXN = 100000;
const int MAXM = 10000000;
int n, m;
pair<int, pair<int, int>> e[MAXM];
int fa[MAXN + 1];
void init() {
  cin >> n;
  m = 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 2; i * j <= n; j++) {
      e[m].second.first = i;
      e[m].second.second = i * j;
      e[m].first = j;
      m++;
    }
  }
  sort(e, e + m);
}
int findfa(int x) {
  if (fa[x] == x) return x;
  fa[x] = findfa(fa[x]);
  return fa[x];
}
void union_set(int x, int y) {
  int fx = findfa(x);
  int fy = findfa(y);
  if (fx != fy) {
    fa[fx] = fy;
  }
}
void solve() {
  long long ans = 0;
  for (int i = 2; i <= n; i++) fa[i] = i;
  for (int i = m - 1; i >= 0; i--) {
    int u = e[i].second.first;
    int v = e[i].second.second;
    int w = e[i].first;
    if (findfa(u) != findfa(v)) {
      ans += (long long)w;
      union_set(u, v);
    }
  }
  cout << ans * 4 << "\n";
}
int main() {
  cin >> n;
  long long ans = 0;
  for (int a = 2; a <= n; a++)
    for (int x = 2; x * a <= n; x++) ans += (long long)x;
  cout << ans * 4 << "\n";
}
