eolymp
Competitions

October 7 - BMTK Programming School, High League

Supernatural

We call a natural number supernatural if it does not contain any ones in its decimal representation and the product of its digits is equal to n. For given n, find how many supernatural numbers exist.

Input

Contains a single integer n not exceeding 2 ×109.

Output

Print the total number of supernatural numbers modulo 101.

Time limit 1 second
Memory limit 128 MiB
Input example #1
1
Output example #1
0
Source ACM-ICPC Ukraine 2013, 2nd Stage Ukraine, September 10-12, 2013