#include <iostream>
using namespace std;
 
int main() {
	long long n, gcd, primeNumInPow, power;
	while(cin >> n)
	{
		gcd = 1;
		for(long long i = 2; i * i <= n; i++) {
			if(n % i == 0) {
				power = 0; primeNumInPow = 1;
				while(n % i == 0) {
					power++;
					primeNumInPow *= i;
					n /= i;
				}
				gcd *= (power + 1)*primeNumInPow - power*primeNumInPow/i;
			}
		}		
		if (n > 1) gcd *= (2*n - 1);
		cout << gcd << endl;
	}
  return 0;
}