#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;
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);
	map<long long, int> geko;
	map<long long, int> copy;
	geko[1] = 1;
	for (int i = 0;i < gyao.size();++i) {
		copy = geko;
		for (auto q = copy.begin();q != copy.end();++q) {
			geko[q->first*gyao[i]]++;
		}
	}
	for (auto i = geko.begin();i != geko.end();++i) {
		string hoge = to_string(i->first) + to_string(n / i->first);
		nya[hoge]++;
	}
	long long ans = 0;
	for (auto i = nya.begin();i != nya.end();++i) {
		ans += 1;
	}
	cout << ans << endl;
	return 0;
}