BETA
This is a school problem. Successful submissions of this are not counted in user ratings.

Submissions : 1722 Accuracy :

25.03

Maximum distance
     

There are n bikes and each can cover 100 km when fully fueled. What is the maximum amount of distance you can go using n bikes? You may assume that all bikes are similar and a bike takes 1 litre to cover 1 km.

The output may contain decimal value but print the integer value of the float value obtained.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N.

Output:

Print the maximum amount of distance. 

Constraints:

1 ≤ T ≤ 20
1 ≤ N ≤ 50

Example:

Input
2
1
2

Output
100

150
 

**For More Examples Use Expected Output**


Set Default Code

					   
Result:
It is recommended to test your code before clicking 'Submit' button!



                   



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