Easy Function

题号：NC210546
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Given an positive integer $x$ , we define $S(x)= \begin{Bmatrix}(i,j)|\sum_{k=i}^{j}k=x,i<=j\end{Bmatrix}$
, $F(x)= |S(x)|$

You need to calculate $\sum_{i=1}^{N}F(i)$ .

As the answer may be too large, you need to print the answer module $10^{9}+7$ .

The first line of the input gives the numbers of test cases, $T (1<=T<=100)$ , $T$ test cases follow.

Each test case consists of one line with one integer $N (1<=N<=2*10^{9})$ as described above.

For each test case, print an integer in one line representing the answer.

示例1

复制

复制

$S(1)=\begin{Bmatrix}(1,1)\end{Bmatrix}$

$S(2)=\begin{Bmatrix}(2,2)\end{Bmatrix}$

$S(3)=\begin{Bmatrix}(1,2),(3,3)\end{Bmatrix}$

$S(4)=\begin{Bmatrix}(4,4)\end{Bmatrix}$

$S(5)=\begin{Bmatrix}(2,3),(5,5)\end{Bmatrix}$