#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<=(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll inf=1e9;


int main(){
	ll n;
	cin>>n;
	ll ans=0;
	for(ll i=1;i*i<=n;i++){
		if(n%i==0 && i*i==n) ans+=1;
		else if(n%i==0)	ans+=2;

	}
	p(ans);
	return 0;
}