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.*;
import java.math.*;
import java.util.*;
import java.util.regex.*;


public class Main {

	final static long MOD = 1000000007;
	public static String[] Ws = null;
	public static int wsIndx = 0;
	public static BufferedReader in = null;
	public static long cnt=0;
	public static PrintWriter pw = new PrintWriter(System.out);
	public static void main(String[] args) throws Exception {
//		solveA(args);
//		solveB(args);
//		solveC(args);
		solveD(args);
//		solveE(args);
//		solveF(args);
		if(in!=null){
			in.close();
		}
		pw.flush();
		pw.close();
	}

	public static void solveA(String[] args) throws Exception{
		int a = nextInt();
		pw.println(a+a*a+a*a*a);
	}
	public static void solveB(String[] args) throws Exception{
		String S = nextString();
		String T = nextString();

		int ans = 0;
		for(int i=0;i<S.length();i++) {
			if(S.charAt(i)!=T.charAt(i)) {
				ans++;
			}
		}
		pw.println(ans);
	}
	public static void solveC(String[] args) throws Exception{
		int N = nextInt();
		int M = nextInt();
		int K = nextInt();

		int[] A = nextInts();
		int[] B = nextInts();

		long[] ruiA = new long[N+1];
		long[] ruiB = new long[M+1];

		for(int i=1;i<ruiA.length;i++) {
			ruiA[i]=ruiA[i-1]+A[i-1];
		}
		for(int i=1;i<ruiB.length;i++) {
			ruiB[i]=ruiB[i-1]+B[i-1];
		}
		long ans = 0;
		int b =M;
		for(int i=0;i<N+1;i++) {
			if(ruiA[i]>K) {
				break;
			}
			while(ruiB[b]+ruiA[i]>K) {
				b--;
			}
			ans=Math.max(i+b,ans);
		}
		pw.println(ans);


	}
	public static void solveD(String[] args) throws Exception{
		int N = nextInt();

		long[] x = new long[N+1];
		boolean[] b = sleveOfEratosthenes(N+1);
		Arrays.fill(x,1);
		for (int i = 2; i < x.length; i++) {
			if(!b[i]) {
				continue;
			}

			for(int k=i;k<x.length;k+=i) {
				long c = 1;
				long v = k;
				while(v!=0&&v%i==0) {
					c++;
					v/=i;
				}
				x[k]*=c;
			}
		}

		long ans = 1;
		for(int i=2;i<=N;i++) {
			ans+=i*x[i];
		}
		pw.println(ans);

	}

	public static boolean[] sleveOfEratosthenes(int n) {
		boolean[] x = new boolean[n];
		Arrays.fill(x, true);
		x[0] = false;
		x[1] = false;
		int max = (int) Math.ceil(Math.sqrt(n) + 0.1);
		for (int i = 2; i < max; i += 2) {
			if (!x[i]) {
				continue;
			}
			for (int k = i * i; k < n; k += i) {
				x[k] = false;
			}
			if (i == 2) {
				i--;
			}
		}
		return x;
	}

	public static void solveE(String[] args) throws Exception{

	}

	public static void solveF(String[] args) throws Exception{

	}

	public static void check() throws Exception{
		if(in == null){
			in = new BufferedReader(new InputStreamReader(System.in));
		}
		if(Ws==null || Ws.length<=wsIndx){
			Ws = in.readLine().split(" ");
			wsIndx=0;
		}
	}
	public static int nextInt()throws Exception{
		check();
		return Integer.parseInt(Ws[wsIndx++]);
	}

	public static long nextLong()throws Exception{
		check();
		return Long.parseLong(Ws[wsIndx++]);
	}

	public static String nextString()throws Exception{
		check();
		return Ws[wsIndx++];
	}

	public static int[] nextInts()throws Exception{
		check();
		int[] tmp = new int[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Integer.parseInt(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static long[] nextLongs()throws Exception{
		check();
		long[] tmp = new long[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Long.parseLong(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static String[] nextStrings()throws Exception{
		check();
		wsIndx=Ws.length;
		return Ws;
	}

}

