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) .
Each line of the following T line
contains a integer n , we can guarantee that 1<=n<=1000000000.