题目描述Description

Bobo has n distinct integers a₁, a₂, …, a_n 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 a₁, a₂, …, a_n.

输入格式Input

The input consists of several test cases and is terminated by end-of-file.

Each test case contains a string s.

• 1 ≤ |s| ≤ 50
• There are at most 100 test cases.

输出格式Output

For each test case, print an integer which denotes the result.

样例Sample

出题Author

ftiasch

来源Source