#pragma comment(linker, "/STACK:65777216")
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <queue>
#include <string>
#include <memory.h>
#include <iterator>
#define mem(A,X) memset(A,X,sizeof(A))
#define memo(A) memset(A,0,sizeof(A))
#define forn(I,B) for (int I=1;I<=(B);I++)
#define forg(H,V) for (int H=first[V];h;h=next[H])
#define rep(I,B) for (int I=0;I<(B);I++)
#define labs(X) (((X)>0)?(X):(-(X)))
#define ropen(X) freopen(X,"r",stdin)
#define wopen(X) freopen(X,"w",stdout)
#define rwopen(X) freopen(X".in","r",stdin);freopen(X".out","w",stdout)
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(),(X).end()
#define sqr(X) ((X)*(X))

using namespace std;

typedef pair <int,int> pii;
typedef pair <long long,long long> pll;
typedef double ld;
typedef long long ll;
typedef vector<int> vi;
const int N=111111;
const int INF=111111111;
const double eps=1e-9;
const double pi=3.14159265358979;

ll x,d[N],c[N],ans,q[N];
int n,ptr;

int main(){
    rwopen("bigsum");
    scanf("%I64d",&x);
    for (ll i=1;i*i<=x;i++)
        if (x%i==0){
            d[++n]=i;
            d[++n]=x/i;
        }
    if (d[n]==d[n-1]) --n;
    sort(d+1,d+n+1);
    forn(i,n){
        ptr=0;
        forn(j,i)
                if (d[i]%d[j]==0){
                q[++ptr]=d[j];
                c[ptr]=x/q[ptr];
            }
        for (int j=ptr;j;j--){
            for (int k=j-1;k;k--) if (q[j]%q[k]==0) c[k]-=c[j];
            ans+=q[j]*c[j];
        }
    }
    printf("%I64d\n",ans);
    return 0;
}