#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<ll> ans(int x) {

	vector<ll> d;

	for (int i = 1; i * i <= x; i++) {
		if (x % i == 0) {
			d.push_back(i);

			if (i != x / i) {
				d.push_back(x / i);
			}
		}

	}

	return d;

}
int main() {

	ll n = 0;
	cin >> n;

	cout << ans(n).size() << endl;

	return 0;
}