#include <iostream>
using namespace std;

typedef long long ll;

ll pw(ll a, int n) {
    ll res = 1;
    while (n) {
        if (n & 1) res *= a;
        a *= a;
        n >>= 1;
    }
    return res;
}

ll f(ll a, int n) {
    return (pw(a, n + 1) - 1) / (a - 1);
}

ll calc(ll x) {
    ll res = 1;
    for (int i = 2; i * i <= x; i = i + 1 + (i & 1)) {
        int cnt = 0;
        while (x % i == 0) x /= i, cnt++;
        if (cnt) res *= f(i, cnt);
    }
    if (x != 1) res *= f(x, 1);
    return res;
}

int main() {
    ll n; cin >> n;
    cout << calc(n);
}

uses crt;

var i,n,s: integer;

function nt(n: integer): boolean;

var i,d: integer;

begin

d:=0;

for i:=1 to n do

if n mod i=0 then d:=d+1;

if d=2 then nt:=true else nt:=false;

end;

begin

clrscr;

write ('nhap n: ');  readln (n);

for i:=1 to n do if nt(i) then s:=s+i;

writeln ('tong la: ',s);

readln;

end.