For this Question: Going through your old stuff you found a weird function F defined as : 
<b>F(N) = summation of ((N-i+1)*log(i)) for i from 1 to N</b>.
Find the maximum value of b such that <b>F(N) = c*log(a) + b</b> where a, b and c are any arbitrary non negative integers satisfying the equality.
(Note that the base of log is 10 everywhere).
Since the answer can be huge, find answer % 1000000007.First line of the input contains T denoting number of test cases. 
Next T lines contains a single integer N for that test case. 

1 <= T <= 100
1 <= N <= 1000000000000000000 (10^18)Print the (maximum value of b) modulo 1000000007 such that F(N) = c*log(a) + b where a, b and c are non negative integers, for each test case in a single line.Sample input
4
1
2
5
12

Sample output
0
0
1
11

Explanation : 
F(1) = 1*log(1) = 0
F(2) = 2*log(1) + 1*log(2) = log(2)
and so on., I have written this Solution Code: t=int(input())
for i in range(t):
    number = int(input())
    x = 5
    ans = 0
    mod = 10**9+7
    while x<=number:
        y = number//x
        ans = (ans+y*number - x*((y*(y+1))//2) + y)%mod
        x = x*5
    print(int(ans)), In this Programming Language: Python, Now tell me if this Code is compilable or not?