#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
template<class T> int Factor_L(T N, T fac[], int fs[]){
  T i;
  int sz = 0;
  if(N%2==0){
    fac[sz] = 2;
    fs[sz] = 1;
    N /= 2;
    while(N%2==0){
      N /= 2;
      fs[sz]++;
    }
    sz++;
  }
  for(i=3;i*i<=N;i+=2){
    if(N%i==0){
      fac[sz] = i;
      fs[sz] = 1;
      N /= i;
      while(N%i==0){
        N /= i;
        fs[sz]++;
      }
      sz++;
    }
  }
  if(N > 1){
    fac[sz] = N;
    fs[sz] = 1;
    sz++;
  }
  return sz;
}
long long N;
int fs;
int fn[100];
long long fac[100];
int main(){
  int i;
  long long res = 1;
  long long tmp;
  long long s;
  rd(N);
  fs =Factor_L(N, fac, fn);
  for(i=(0);i<(fs);i++){
    int j;
    s = tmp = 1;
    for(j=(0);j<(fn[i]);j++){
      s += (tmp *= fac[i]);
    }
    res *= s;
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20190919-1 [beta]

// --- original code ---
// ll N;
// int fs, fn[100];
// ll fac[100];
// {
//   ll res = 1, tmp, s;
//   rd(N);
//   fs = Factor(N, fac, fn);
//   rep(i,fs){
//     s = tmp = 1;
//     rep(j,fn[i]){
//       s += (tmp *= fac[i]);
//     }
//     res *= s;
//   }
//   wt(res);
// }