#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
using namespace std;
typedef  long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)

lint name(lint A, lint B) {
	vector<lint>V(B + 1);
	V[0] = 1;
	for (lint i = 1; i <= B; i++) {
		V[i] = V[i - 1] * A;
	}
	lint ans = 0;
	rep(i, V.size()) {
		ans += V[i];
	}
	return ans;
}

vector<lint> prime_factorization(lint N) {
	//素因数分解して配列で返す
	vector<lint> R;
	if (N < 2)return R;
	for (lint i = 2; i * i <= N; i++) {
		while (N % i == 0) {
			R.push_back(i);
			N /= i;
		}
	}
	if (N != 1) {
		R.push_back(N);
	}
	return R;
}

int main() {
	lint N;
	cin >> N;
	vector<lint>A = prime_factorization(N);
	lint cnt = 1;
	lint ans = 1;
	for (int i = 1; i < A.size(); i++) {
		if (A[i] == A[i - 1]) {
			cnt++;
		}
		else {
			ans *= name(A[i - 1], cnt);
			cnt = 1;
		}
	}
	ans *= name(A[A.size() - 1], cnt);
	cout << ans << endl;
}