#include <bits/stdc++.h>
using namespace std;
long long int solve() {
  long long int n;
  cin >> n;
  vector<long long int> primes;
  long long int cnt = 0;
  while (n % 2 == 0) {
    cnt++;
    n /= 2;
  }
  primes.push_back(cnt);
  cnt = 0;
  for (long long int j = 3; j <= sqrt(n); j += 2) {
    while (n % j == 0) {
      n /= j;
      cnt++;
    }
    primes.push_back(cnt);
    cnt = 0;
  }
  if (n != 1) {
    primes.push_back(1);
  }
  long long int ans = 1;
  for (long long int j = 0; j < primes.size(); j++) {
    ans *= (primes[j] + 1);
  }
  cout << ans << "\n";
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
