#include<iostream>
#include<math.h>
#include<iomanip>
#include <string>
#include<algorithm>
#include <vector>
using namespace std;
long long fact(int m) {
long long factorial = 1;
for (int i = 1;i <= m;i++) {
factorial *= i;
}
return factorial;
}
void fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fast();
int n;
cin >> n;
int count = 1;
long long factorial = 1;
for (int i = 1;i <= n;i++) {
factorial *= i;
while (factorial >= 10) {
count++;
factorial /= 10;
}
}
cout << "Number of digits of " << n << "! is " << count;
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+IAojaW5jbHVkZTxtYXRoLmg+CiNpbmNsdWRlPGlvbWFuaXA+CiNpbmNsdWRlIDxzdHJpbmc+CiNpbmNsdWRlPGFsZ29yaXRobT4KI2luY2x1ZGUgPHZlY3Rvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmxvbmcgbG9uZyBmYWN0KGludCBtKSB7CiAgICBsb25nIGxvbmcgZmFjdG9yaWFsID0gMTsKICAgIGZvciAoaW50IGkgPSAxO2kgPD0gbTtpKyspIHsKICAgICAgICBmYWN0b3JpYWwgKj0gaTsKICAgIH0KICAgIHJldHVybiAgZmFjdG9yaWFsOwp9CnZvaWQgZmFzdCgpCnsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBjaW4udGllKDApOwogICAgY291dC50aWUoMCk7Cn0KCmludCBtYWluKCkKewogICAgZmFzdCgpOwoKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgaW50IGNvdW50ID0gMTsKICAgICAgICBsb25nIGxvbmcgZmFjdG9yaWFsID0gMTsKCiAgICAgICAgZm9yIChpbnQgaSA9IDE7aSA8PSBuO2krKykgewogICAgICAgICAgICBmYWN0b3JpYWwgKj0gaTsKCiAgICAgICAgICAgIHdoaWxlIChmYWN0b3JpYWwgPj0gMTApIHsKICAgICAgICAgICAgICAgIGNvdW50Kys7CiAgICAgICAgICAgICAgICBmYWN0b3JpYWwgLz0gMTA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICAgICAgY291dCA8PCAiTnVtYmVyIG9mIGRpZ2l0cyBvZiAiIDw8IG4gPDwgIiEgaXMgIiA8PCBjb3VudDsKICAgICAgICAKICAgIHJldHVybiAwOwp9Cg==