#include <stdio.h>
int main() {
// Precompute Fibonacci numbers up to n=38
int fib[39];
fib[1] = 1;
fib[2] = 1;
for (int i = 3; i <= 38; i++) {
fib[i] = fib[i-1] + fib[i-2];
}
// Precompute trailing zeros for each Fibonacci number's factorial
int zeros[39];
for (int i = 1; i <= 38; i++) {
int m = fib[i];
int count = 0;
while (m >= 5) {
m /= 5;
count += m;
}
zeros[i] = count;
}
// Read input and output results
int N, n;
while (N--) {
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpIHsKICAgIC8vIFByZWNvbXB1dGUgRmlib25hY2NpIG51bWJlcnMgdXAgdG8gbj0zOAogICAgaW50IGZpYlszOV07CiAgICBmaWJbMV0gPSAxOwogICAgZmliWzJdID0gMTsKICAgIGZvciAoaW50IGkgPSAzOyBpIDw9IDM4OyBpKyspIHsKICAgICAgICBmaWJbaV0gPSBmaWJbaS0xXSArIGZpYltpLTJdOwogICAgfQoKICAgIC8vIFByZWNvbXB1dGUgdHJhaWxpbmcgemVyb3MgZm9yIGVhY2ggRmlib25hY2NpIG51bWJlcidzIGZhY3RvcmlhbAogICAgaW50IHplcm9zWzM5XTsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IDM4OyBpKyspIHsKICAgICAgICBpbnQgbSA9IGZpYltpXTsKICAgICAgICBpbnQgY291bnQgPSAwOwogICAgICAgIHdoaWxlIChtID49IDUpIHsKICAgICAgICAgICAgbSAvPSA1OwogICAgICAgICAgICBjb3VudCArPSBtOwogICAgICAgIH0KICAgICAgICB6ZXJvc1tpXSA9IGNvdW50OwogICAgfQoKICAgIC8vIFJlYWQgaW5wdXQgYW5kIG91dHB1dCByZXN1bHRzCiAgICBpbnQgTiwgbjsKICAgIHNjYW5mKCIlZCIsICZOKTsKICAgIHdoaWxlIChOLS0pIHsKICAgICAgICBzY2FuZigiJWQiLCAmbik7CiAgICAgICAgcHJpbnRmKCIlZFxuIiwgemVyb3Nbbl0pOwogICAgfQoKICAgIHJldHVybiAwOwp9