#include "bits/stdc++.h"

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using VP = vector<P>;
using VLL = vector<ll>;

const int INF = 2147483647;
const ll MOD = 1e9 + 7;
const ll LINF = 1e9;
const ld EPS = 1e-9;

// int ctoi(const char c) {if ('0' <= c && c <= '9') return (c - '0'); return -1;}

template <class T>
void out(T value, bool nl = true) { cout << value << (nl ? "\n" : ""); }

/*  divisor(n)
	入力：整数 n
	出力：nのすべての約数
	計算量：O(√n)
*/
std::vector<long long> divisor(long long n) {
	std::vector<long long> ret;
	for (long long i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			ret.push_back(i);
			if (i * i != n) ret.push_back(n / i);
		}
	}
	sort(ret.begin(), ret.end()); // 昇順に並べる
	return ret;
}

void solve()
{
	int x; cin >> x;
	VLL divs = divisor(x);

	ll A = accumulate(ALL(divs), 0LL);
	ll B{ 0 };
	for (ll v: divs) {
		B += (1 / v);
	}
	cout << A / B << "\n";


}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    std::cout << std::fixed << std::setprecision(15);
    solve();
    return EXIT_SUCCESS;
}