暑期训练2：AtCoder Beginner Contest 208 B - Factorial Yen Coin

B - Factorial Yen Coin
Time Limit: 2 sec Memory Limit: 1024 MB

Score :
200
points

Problem Statement
The coins used in the Kingdom of Takahashi are
1
!
-yen coins,
2
!
-yen coins,
…
, and
10
!
-yen coins. Here,
N
!

1
×
2
×
⋯
×
N
.

Takahashi has
100
of every kind of coin, and he is going to buy a product worth
P
yen by giving the exact amount without receiving change.

We can prove that there is always such a way to make payment.

At least how many coins does he need to use in his payment?

Constraints
1
≤
P
≤
10
7
P
is an integer.
Input
Input