BETA

Difficulty Level: Easy

Submissions: 2063 Accuracy:

13.48%

Product of two digit numbers
     

Sharad  is fond of Mathematics and thought of playing with it. He assumes an even digit number, then partition the number into multiple numbers of two digits. For ex: if he chooses 1345 then he parts the number into 13 and 45. Now, he wants to calculate the product of these two digit numbers. The product for the above example is 585. He challenges you to do this work through a program. 

Input:.
First line of the input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of a single line containing an even digit number N.

Output:
Corresponding to each test case, in a new line, print the desired output modulo 10^9 + 7

Constraints:
1 ≤ T ≤ 100

1 ≤ N ≤ 10^20


Example:

Input:
3
2222
11
1010

Output:
484
11
100

Example: In first case 2222 it can be divided into 22 and 22..so the result is 484

                  In Second case 11 it can divide into only 11 so our result is 11

                  In third case 1010 it can be divided into 10 and 10 .. so outcome is 100

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: karan kumar

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.