#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
	// make table
	const int L = 62;
	vector<ll> dp(L);
	dp[0] = 1;
	for (int i = 1; i < L; i++) for (int j = 0; j < L - i; j++){
		dp[i + j] += dp[j];
	}
	// input
	ll N;
	cin >> N;
	ll ans = 1;
	for (int i = 2; i <= 1001001; i++){
		int tmp = 0;
		while (N % i == 0){
			tmp++;
			N /= i;
		}
		ans *= dp[tmp];
	}
	ll l = 1, r = 1001001001;
	while (r - l > 1){
		ll M = (l + r) / 2;
		if (M * M <= N) l = M;
		else r = M;
	}
	if (l != 1 && l * l == N) ans *= 2;
	cout << ans << "\n";
}