#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
 
#define LL long long 
 
const int maxn=31623;
const int INF=0x3f3f3f3f;
 
LL e[maxn], ans=1;
int n, cnt;
 
void fj(int n) {
	for(int i=2; i<=n; i++) {
		while(n%i==0) {
			n/=i;
			e[cnt]++;
		}
		cnt++;
	}
}
 
int main() {
	freopen("lancer.in","r",stdin);
    freopen("lancer.out","w",stdout);
	scanf("%d", &n);
	fj(n); 
	for(int i=0; i<cnt; i++) ans=ans*(e[i]+2)*(e[i]+1)/2;      
	cout<<ans;
	return 0;
}
/*
https://blog.csdn.net/coolkid_cwm/article/details/53043602
https://blog.csdn.net/mrcrack/article/details/80352151
*/