#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>

std::vector<std::pair<long long int, long long int>> PrimeFact(long long int n){
	std::vector<std::pair<long long int, long long int>> result;
	double sqrtn = std::sqrt(n);
	for(long long int i=2; i<sqrtn; ++i){
		int divCount = 0;
		if(n%i == 0){
			do{
				++divCount;
				n/=i;
			}while(n%i == 0);
		    result.push_back(std::make_pair(i, divCount));
		}
	}
    if(n!=1){
        result.push_back(std::make_pair(n, 1));
    }
	return result;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    long long int n, ans = 1;
    std::cin >> n;
    std::vector<std::pair<long long int, long long int>> p = PrimeFact((n%2==1) ? n : n/2);
    std::vector<long long int> sum(p.size(), 0);

    for(size_t i=0; i<p.size(); ++i){
        for(int j=0; j<=p[i].second; ++j){
            sum[i] += std::pow(p[i].first, j);
        }
        ans *= sum[i];
    }
    std::cout << ans << "\n";
    
    return 0;
}