#include <bits/stdc++.h>
using namespace std;
 
int process(int n)
{
	int ex=1;
	long long ans=1;
 
		while(!(n%2)){
			n/=2;
			ex++;
		}
 
	ans=ans*(ex);
	for(int i=3;i*i<=n;i+=2){//we will go till root(n) only as after that only one prime would be left or 1
 
			ex=1;
			while(!(n%i)){
				n/=i;
				ex++;
				//push I if you want all the primes
			}
			ans*=(ex);
 
	}
	if(n>1) ans*=2;
	//push n if you want all the prime factors
	return ans;
}
int main()
{
    int n;cin>>n;
    cout<<process(n);
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgcHJvY2VzcyhpbnQgbikKewoJaW50IGV4PTE7Cglsb25nIGxvbmcgYW5zPTE7CgoJCXdoaWxlKCEobiUyKSl7CgkJCW4vPTI7CgkJCWV4Kys7CgkJfQoKCWFucz1hbnMqKGV4KTsKCWZvcihpbnQgaT0zO2kqaTw9bjtpKz0yKXsvL3dlIHdpbGwgZ28gdGlsbCByb290KG4pIG9ubHkgYXMgYWZ0ZXIgdGhhdCBvbmx5IG9uZSBwcmltZSB3b3VsZCBiZSBsZWZ0IG9yIDEKCgkJCWV4PTE7CgkJCXdoaWxlKCEobiVpKSl7CgkJCQluLz1pOwoJCQkJZXgrKzsKCQkJCS8vcHVzaCBJIGlmIHlvdSB3YW50IGFsbCB0aGUgcHJpbWVzCgkJCX0KCQkJYW5zKj0oZXgpOwoKCX0KCWlmKG4+MSkgYW5zKj0yOwoJLy9wdXNoIG4gaWYgeW91IHdhbnQgYWxsIHRoZSBwcmltZSBmYWN0b3JzCglyZXR1cm4gYW5zOwp9CmludCBtYWluKCkKewogICAgaW50IG47Y2luPj5uOwogICAgY291dDw8cHJvY2VzcyhuKTsKfQo=

MTAw

100