#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1, -1, -1, 1, 1};
int dy[] = {-1, 1, 0, 0, -1, 1, -1, 1};
bool mark[100007];
long long int n, in = -1, prime[100007];
void seive() {
  prime[++in] = 2;
  for (long long int i = 3; i * i < 100007; i += 2) {
    if (mark[i] == 0)
      for (long long int j = i * i; j < 100007; j += 2 * i) mark[j] = 1;
  }
  for (long long int i = 3; i < 100007; i += 2) {
    if (mark[i] == 0) prime[++in] = i;
  }
}
int main() {
  seive();
  cin >> n;
  long long int c, div = 1;
  for (long long int i = 0; i <= in; i++) {
    if (n % prime[i] == 0) {
      c = 1;
      while (n % prime[i] == 0) {
        n /= prime[i];
        c++;
      }
      div *= c;
    }
  }
  if (n > 2) div *= 2;
  cout << div << endl;
}
