#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Miller {
	const std::vector<long long> v = { 2 , 7 , 61 }; // < 4,759,123,141
	// x^k (mod m)
	long long modpow(long long x, long long k, long long m) {
		long long res = 1;
		while (k) {
			if (k & 1) {
				res = res * x % m;
			}
			k /= 2;
			x = x * x % m;
		}
		return res;
	}
	// check if n is prime
	bool check(long long n) {
		if (n < 2) {
			return false;
		}
		long long d = n - 1;
		long long s = 0;
		while (d % 2 == 0) {
			d /= 2;
			s++;
		}
		for (long long a : v) {
			if (a == n) {
				return true;
			}
			if (modpow(a, d, n) != 1) {
				bool ok = true;
				for (long long r = 0; r < s; r++) {
					if (modpow(a, d * (1LL << r), n) == n - 1) {
						ok = false;
						break;
					}
				}
				if (ok) {
					return false;
				}
			}
		}
		return true;
	}
};
struct Rho {
	std::mt19937 mt;
	Miller miller;
	long long c;
	Rho() {
		mt.seed(clock());
	}
	inline long long f(long long x, long long n) {
		return (x * x + c) % n;
	}
	long long check(long long n) {
		if (n == 4) {
			return 2;
		}
		c = mt() % n;
		long long x = mt() % n;
		long long y = x;
		long long d = 1;
		while (d == 1) {
			x = f(x, n);
			y = f(f(y, n), n);
			d = std::gcd(abs(x - y), n);
		}
		if (d == n) {
			return -1;
		}
		return d;
	}
	std::vector<long long> factor(long long n) {
		if (n <= 1) {
			return {};
		}
		if (miller.check(n)) {
			return { n };
		}
		long long res = -1;
		while (res == -1) {
			res = check(n);
		}
		std::vector<long long> fa = factor(res);
		std::vector<long long> fb = factor(n / res);
		fa.insert(fa.end(), fb.begin(), fb.end());
		return fa;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	Rho rho;
	long long n; cin >> n;
	auto v = rho.factor(n);
	map<long long, int>mp;
	rep(i, v.size()) mp[v[i]]++;
	long long ans = 1;
	vector<long long>devide = { 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627, 792, 1002, 1255, 1575, 1958, 2436, 3010, 3718, 4565, 5604, 6842, 8349, 10143, 12310 };
	for (auto[k, v] : mp) ans *= devide[v];
	cout << ans << endl;
	return 0;
}