Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 25, Accepted users: 21

Problem 10844 :
No special judgement

Problem description

Though little FeiBo is now in grade
three , He is prepareing for National Collegiate Mathematical Contest .

Today he killed a very interesting
problem in a second : Assuming that function f(x) = [x] represents the maximum
integer which is not more than x . For instance , f(3.14) = 3 , f(-0.2) = -1 .

Here is the task of the problem :

We will give you a integer n , please
tell me the S(n) .

Input

The first line contains a integer T ,
represent the number of test case . 1<=T<=1000.

Each line of the following T line
contains a integer n , we can guarantee that 1<=n<=1000000000.