#include <stdio.h>
#include <math.h>
int limit, j, n, sum=1, i=2, mu;
int Prime(int x) {
if (x<2) return 0;
for (j=2;j<=limit;j++) {
if (x%j==0) return 0;
}
return 1;
}
int main () {
else {
while (n!=1) {
if (n%i==0 && Prime(i)) {
mu=0;
while (n%i==0) {
mu++;
n/=i;
}
sum*=mu+1;
}
i++;
}
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxtYXRoLmg+CmludCBsaW1pdCwgaiwgbiwgc3VtPTEsIGk9MiwgbXU7CmludCBQcmltZShpbnQgeCkgewogICAgaWYgKHg8MikgcmV0dXJuIDA7CiAgICBsaW1pdD1zcXJ0KHgpOwogICAgZm9yIChqPTI7ajw9bGltaXQ7aisrKSB7CiAgICAgICAgaWYgKHglaj09MCkgcmV0dXJuIDA7CiAgICB9CiAgICByZXR1cm4gMTsKfQppbnQgbWFpbiAoKSB7CiAgICBzY2FuZigiJWQiLCAmbik7CiAgICBpZiAobjwyKSBwcmludGYoIjEiKTsKICAgIGVsc2UgewogICAgICAgIHdoaWxlIChuIT0xKSB7CiAgICAgICAgICAgIGlmIChuJWk9PTAgJiYgUHJpbWUoaSkpIHsKICAgICAgICAgICAgICAgIG11PTA7CiAgICAgICAgICAgICAgICB3aGlsZSAobiVpPT0wKSB7CiAgICAgICAgICAgICAgICAgICAgbXUrKzsKICAgICAgICAgICAgICAgICAgICBuLz1pOwogICAgICAgICAgICAgICAgfQogICAgICAgICAgICAgICAgc3VtKj1tdSsxOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGkrKzsKICAgICAgICB9CiAgICB9CiAgICBwcmludGYoIiVkIiwgc3VtKTsKICAgIHJldHVybiAwOwp9Cg==