#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
using namespace std;

int main(void){
    long long n, cnt=0, ans;
    cin >> n;
    bool root = false;
    for(int i=1;i<=sqrt(n);i++){
        if(n%i == 0){
            if(i == sqrt(n)){
        		root = true;
        	}else{
        		cnt++;
        	}
        }
        
    }
    if(root == true){
    	ans = cnt*2+1;
    }else{
    	ans = cnt*2;
    }
    cout << ans << endl;

    return 0;
}