#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define eps 0.000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
map<string, int> nya;
vector<int> gyao;
vector<long long> solve(long long now) {
	vector<long long> ans;
	if (now + 1 != gyao.size()) {
		ans = solve(now + 1);
		int hogee = ans.size();
		for (int i = 0;i < hogee;i++) {
			ans.push_back(ans[i] * gyao[now]);
		}
	}
	else {
		ans.push_back(1);
		ans.push_back(gyao[now]);
	}
	return ans;
}
int main() {
	long long n;
	cin >> n;
	long long tmp = n;
	long long i = 2;
	while (i <= sqrt(tmp)) {
		if (tmp % i == 0) {
			gyao.push_back(i);
			tmp /= i;
		}else{
			i++;
		}
	}
	gyao.push_back(tmp);
	vector<long long> geko = solve(0);
	for (int i = 0;i < geko.size();++i) {
		string hoge = to_string(geko[i]) + to_string(n / geko[i]);
		nya[hoge]++;
	}
	long long ans = 0;
	for (auto i = nya.begin();i != nya.end();++i) {
		ans += 1;
	}
	cout << ans << endl;
	return 0;
}