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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @author Don Li
 */
public class FunWithIntegers {
    
    int[] parent;
    
    void solve() {
        int n = in.nextInt();
        
        parent = new int[n + 1];
        Arrays.fill(parent, -1);
        
        for (int i = 2; i <= n; i++) {
            for (int j = i + i; j <= n; j += i) {
                union(i, j);
            }
        }
        
        int[] sz = new int[n + 1];
        for (int i = 2; i <= n; i++) {
            int j = find(i);
            sz[j]++;
        }
        int[][] comp = new int[n + 1][];
        for (int i = 2; i <= n; i++) {
            comp[i] = new int[sz[i]];
        }
        for (int i = 2; i <= n; i++) {
            int j = find(i);
            comp[j][--sz[j]] = i;
        }
        
        long ans = 0;
        for (int i = 2; i <= n; i++) {
            long tot = 0;
            for (int x : comp[i]) {
                for (int y = x + x; y <= n; y += x) tot += y / x;
            }
            ans = Math.max(ans, tot);
        }
        out.println(ans * 4);
    }
    
    int find(int i) {
        if (parent[i] < 0) return i;
        return parent[i] = find(parent[i]);
    }
    
    void union(int i, int j) {
        int u = find(i), v = find(j);
        if (u == v) return;
        if (parent[u] > parent[v]) {
            int tmp = u; u = v; v = tmp;
        }
        parent[u] += parent[v];
        parent[v] = u;
    }
    
    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new FunWithIntegers().solve();
        out.close();
    }
    
    static FastScanner in;
    static PrintWriter out;
    
    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        public FastScanner(BufferedReader in) {
            this.in = in;
        }
        
        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
        
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
        
        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}
