#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
  ll N=0;cin>>N;
  ll a=N;
  ll b=0;
  if(N%2==0){
    while(1){
      if(a%2!=0){
        break;
      }
      a/=2;
      b+=1;
    }
  }
  if(a>1){
    vector<ll> v;
    for(ll i=3;i*i<=a;i+=2){
      if(a%i==0){
        v.push_back(i);
        v.push_back(a/i);
      }
    }
    sort(v.begin(),v.end());
    auto result=unique(v.begin(),v.end());
    v.erase(result,v.end());
    for(ll i=0;i<v.size();++i){
      a+=v[i];
    }
  }
  if(N>2) a+=1;
  ll c=pow(2,b);
  c-=1;
  if(c>0) a*=c;
  cout<<a<<endl;
}