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 = 2e6 + 10;
const int INF = 1e9 + 9;
const int B = 1e9 + 7;
long long p[N], s[N];
int fp(int first) {
  return first == p[first] ? first : p[first] = fp(p[first]);
}
void u(int a, int b, int d) {
  if (fp(a) == fp(b)) return;
  p[fp(a)] = fp(b);
  s[fp(b)] += s[fp(a)] + 4 * d;
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<long long> a(n + 1);
  long long ans = 0;
  for (int i = int(2); i <= int(n); ++i) p[i] = i, s[i] = 0;
  for (int i = int(n); i >= int(2); --i)
    for (int j = 2; i * j <= n; ++j) u(i, i * j, j);
  for (int i = int(2); i <= int(n); ++i) ans = max(ans, s[fp(i)]);
  cout << ans << "\n";
  return 0;
}
