#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll calc(ll n, ll prm) {
ll p = prm, ans = 0;
while (n < prm) {
cout << n << ' ' << p << '\n';
ans += n / p;
p *= prm;
}
return ans;
}
int main() {
ll n = 40;
ll prime[] = {2,3,5,7,11,13,17,19,23,29,31,37};
ll ans = 1;
for (int i = 0; i < 12; i++) {
ll pec = calc(n, prime[i]);
ans *= (pec + 1);
}
cout << ans << '\n';
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmxsIGNhbGMobGwgbiwgbGwgcHJtKSB7CglsbCBwID0gcHJtLCBhbnMgPSAwOwoJd2hpbGUgKG4gPCBwcm0pIHsKCQljb3V0IDw8IG4gPDwgJyAnIDw8IHAgPDwgJ1xuJzsKICAgICAgIGFucyArPSBuIC8gcDsKICAgICAgIHAgKj0gcHJtOwoJfQoJcmV0dXJuIGFuczsKfQppbnQgbWFpbigpIHsKCglsbCBuID0gNDA7IAoJbGwgcHJpbWVbXSA9IHsyLDMsNSw3LDExLDEzLDE3LDE5LDIzLDI5LDMxLDM3fTsKCWxsIGFucyA9IDE7Cglmb3IgKGludCBpID0gMDsgaSA8IDEyOyBpKyspIHsKCQlsbCBwZWMgPSBjYWxjKG4sIHByaW1lW2ldKTsKCQlhbnMgKj0gKHBlYyArIDEpOwoJfQoJY291dCA8PCBhbnMgPDwgJ1xuJzsKfQ==
MTAKYWJhCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtzCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtzCmdlZWtzZm9yZ2Vla3MKZ2Vla3Nmb3JnZWVrcwpnZWVrc2ZvcmdlZWtz
10
aba
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks