#include <stdio.h>
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <string>
#include <string.h>

typedef long long ll;
const int N = 1e5+3;

using namespace std;

int main()
{
    //freopen("input.txt", "r", stdin);
    ll n ;
    scanf("%lld", &n);
    ll ans =0 ;
    for (ll i = 1; i*i <= n; ++i)
        if (n%i==0) {
            ll x = n/i;
          //  printf("%lld\n", x);
            for (ll j = i; j*j <=x; ++j)
                if (x%j==0) {
                    ans++;
       //             printf("%lld %lld %lld\n", i,j,x/j);
                }
        }
    printf("%lld\n",ans);
    return 0;
}