#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	lint N;
	cin >> N;
	double n = sqrt(N);
	lint ans = 0;
	if (lint(n) - n == 0) {
		ans -= 1;
	}
	for (int ia = 1; ia <= lint(n); ia++) {
		if (N % ia == 0) {
			ans += 2;
		}
	}
	cout << ans << endl;
}