For a positive integer X, let f(X) be the number of positive divisors of X.

Given a positive integer N, find \sum_{K=1}^N K\times f(K).

Constraints

* 1 \leq N \leq 10^7

Input

Input is given from Standard Input in the following format:


N


Output

Print the value \sum_{K=1}^N K\times f(K).

Examples

Input

4


Output

23


Input

100


Output

26879


Input

10000000


Output

838627288460105

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.stream.IntStream;

public class Main {
    public static void main(final String[] args) {
        final FastScanner scanner = new FastScanner(System.in);
        final int n = scanner.nextInt();

        final long[] array = new long[n + 1];
        Arrays.fill(array, 1);

        final int[] values = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            values[i] = i;
        }

        for (int i = 2; i <= Math.sqrt(n); i++) {
            if (values[i] == 1) {
                continue;
            }

            for (int j = 1; j * i <= n; j++) {
                int count = 1;
                while (values[i * j] % i == 0) {
                    values[i * j] /= i;
                    count++;
                }
                array[i * j] *= count;
            }
        }

        final long answer = IntStream.rangeClosed(1, n)
            .mapToLong(i -> i * (array[i] * (values[i] > 1 ? 2 : 1)))
            .sum();
        System.out.println(answer);
    }

    private static class FastScanner {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(final InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (final IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
    }
}
    