#include <bits/stdc++.h>
#include <cstdint>
#include <sys/time.h>

typedef std::int_fast32_t  s32;
typedef std::uint_fast32_t u32;
typedef std::int_fast64_t  s64;
typedef std::uint_fast64_t u64;

const unsigned long mod = 1000000007;
const double EPS = 0.00000001;
const int INF = (1 << 30);

template<typename T, size_t max_size>
class fastvector {
public:
  T element[max_size];
  size_t size_;
  fastvector() {
    size_ = 0;
  }
  inline void push_back(T arg) {
    element[size_] = arg;
    size_ += 1;
  }
  inline size_t size() {
    return size_;
  }
  inline T& operator [](int i) {
    return element[i];
  }
};

template<typename T, typename U>
class fastpair {
public:
  T first;
  U second;
  fastpair(T f_, U s_) {
    first  = f_;
    second = s_;
  }
  fastpair() {}
};

inline fastvector<fastpair<long, long>, 32> prime_factorization(long n) {
  long limit = sqrt(n) + 100;
  long count;
  fastvector<fastpair<long, long>, 32> res;  
  {
    long i = 2;
    count = 0;
    while( n % i == 0 ) {
      count += 1;
      n /= i;
    }
    if( count != 0 ) {
      res.push_back(fastpair<long, long>(i, count));
    }
  }
  for(long i = 3; i < limit; i+=2) {
    count = 0;
    while( n % i == 0 ) {
      count += 1;
      n /= i;
    }
    if( count != 0 ) {
      res.push_back(fastpair<long, long>(i, count));
    }
  }
  if( n != 0 and n != 1 ) {
    res.push_back(fastpair<long, long>(n, 1));
  }
  return res;
}

inline long sum_of_divisor(fastvector<fastpair<long, long>, 32> pf) {
  long res = 1;
  int n = pf.size();
  for(int i = 0; i < n; ++i) {
    long temp = 1;
    long p = 1;
    for(long j = 1; j <= pf[i].second; ++j) {
      p *= pf[i].first;
      temp += p;
    }
    res *= temp;
  }
  return res;
}

int main() {
  
  long n;
  std::cin >> n;

  if( n % 2 == 0 ) n /= 2;

  auto res = prime_factorization(n);

  std::cout << sum_of_divisor(res) << std::endl;
 
  return 0;
}