/*
	Counting the number of divisors of an Integer
	@Author: md.moniruzzaman
*/

#include<stdio.h>
#define maxn 46342

char Flag[maxn+1];
int Prime[4799], totalPrime;



void Sieve() {
	int i, j;
	for(i = 2; i*i<=maxn;) {
		for(j = i+i; j<=maxn; j+= i) {
			Flag[j] = 1;
		}
		for(++i; Flag[i]; i++);
	}
	Prime[0] = 2;
	totalPrime = 1;
	for(i = 3; i<maxn; i += 2) { // i+=2 ?? there is no consecutive prime except 2,3
		if(Flag[i] == 0) {
			Prime[totalPrime++] = i;
		}
	}
	
	
}

void countDivisor(int n) {
	int i, totalDiv = 1, temp;
	for(i = 0; Prime[i]*Prime[i] <= n; i++) {
		temp = 1;
		while(n % Prime[i] == 0) {
			temp ++;
			n /= Prime[i];
		}
		totalDiv *= temp;
	}
	if(n > 1) totalDiv *= 2;
	printf("%d\n",totalDiv);
}

void main() {
	int n;
	Sieve();
	scanf("%d",&n); 
	countDivisor(n);
}