#include <bits/stdc++.h>
using namespace std;

using lli = long long int;

template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

template <class T>ostream &operator<<(ostream &o,const pair<T, T>&p)
{o<<"("<<p.first<<", "<<p.second<<")";return o;}

map< int64_t, int > prime_factor(int64_t n) {
  map< int64_t, int > ret;
  for(int64_t i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}

int main(void){
    lli n;
    cin >> n;
    auto m = prime_factor(n);
    vector<lli> sumv;
    for(auto i : m){
        lli sum = 0;
        for(lli j = 0; j < i.second+1; j++){
            sum += pow(i.first, j);
        }
        sumv.push_back(sum);
    }
    lli res = 1;
    for(auto i : sumv) res*=i;
    cout << res << endl;
    return 0;
}