题号：NC53384
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
题目描述
Bobo has n distinct integers 
in [0, 99].
He writes them in decimal notation without leading zeros in a row, obtaning a string s.
Given the string s, find the number of possible array of integers.
He writes them in decimal notation without leading zeros in a row, obtaning a string s.
Given the string s, find the number of possible array of integers
输入描述:
The input consists of several test cases and is terminated by end-of-file.
Each test case contains a string s.
*
* There are at most 100 test cases.
输出描述:
For each test case, print an integer which denotes the result.