#include <bits/stdc++.h>
using namespace std;
using u64 = unsigned long long;

u64 count_divisors(u64 x){
    u64 res = 1;
    for(u64 p = 2; p * p <= x; ++p){
        if(x % p == 0){
            int e = 0;
            while(x % p == 0){
                x /= p;
                ++e;
            }
            res *= (e + 1);
        }
    }
    if(x > 1) res *= 2; // ??????
    return res;
}

int main(){
    unsigned long long x;
    if(!(cin >> x)) return 0;
    cout << count_divisors(x) << '\n';
    return 0;
}