#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>

#define AS(a) (sizeof(a)/sizeof(a[0]))
using namespace std;
long long int MOD = 1000000007;
long long int INF = 1000000007;


int main() {
  long long int n;
  cin >> n;
  int count = 0;
  for(int i = 1; i <= (int)sqrt(n); i++) {
    if(n % i == 0) {
      count += 2;
    }
  }
  if(floor(sqrt(n)) == ceil(sqrt(n))) count--;
  cout << count << endl;

}