3627 - John's Boards 3627 - Los Tableros de Juan 3627 - John's Boards

Statistics Sub: 85 | AC: 38 | AC%: 44,71 | Score: 2,82
Created by Oreste Nillar Cambara
Added by Oreste (2016-04-30)
Limits
Total Time: 2000 MS | Test Time: 1500 MS |Memory: 512 MB | Output: 64 MB | Size: 16 KB
Enabled languages
Available in

Description

Farmer John is traveling to the city. Away from the cows and the farm he needs to find something to occupy his mind. This time John has been playing with boards similar to chessboards. He takes a NxN board and in each square writes the number of rectangles containing that square. He wants to know for a NxN board the total sum of all numbers written on the board.
El granjero Juan está viajando a la ciudad. Lejos de las vacas y la granja, él necesita ocupar su mente. Esta vez, Juan ha estado jugando con tableros similares a los del ajedrez. Él tomó un tablero de NxN  y en cada casilla colocó el número de rectángulos en los que se encuentra dicha casilla. Él quiere conocer para un tablero de NxN la suma total de todos los números ubicados en el mismo.
Farmer John is traveling to the city. Away from the cows and the farm he needs to find something to occupy his mind. This time John has been playing with boards similar to chessboards. He takes a NxN board and in each square writes the number of rectangles containing that square. He wants to know for a NxN board the total sum of all numbers written on the board.

Input specification

In the first line there is an integer value M (1 <= M <= 10000) representing the number of test cases. For each test case one integer value N (1 <= N <= 10^9) is given in a separate line.

La primera línea está formada por un entero M (1 <= M <= 10000) indicando la cantidad de casos de prueba. Cada caso estará representado por una línea con un entero N (1 <= N <= 10^9) que establece las dimensiones del tablero.
In the first line there is an integer value M (1 <= M <= 10000) representing the number of test cases. For each test case one integer value N (1 <= N <= 10^9) is given in a separate line.

Output specification

Print the answer to the problem described above in a separate line for each test case. As the result can be very long you should print it with modulus 10^9+7.
Por cada caso de prueba imprima un entero con la respuesta al problema entes descrito en una línea. Como este valor puede ser muy grande, usted deberá obtener la solución módulo 10^9 + 7.
In the first line there is an integer value M (1 <= M <= 10000) representing the number of test cases. For each test case one integer value N (1 <= N <= 10^9) is given in a separate line.

Sample input

2
2
1

Sample output

16
1

Hint(s)

http://coj.uci.cu/24h/
http://coj.uci.cu/24h/
http://coj.uci.cu/24h/

Recommendation

We have carefully selected several similar problems: 2156 | 2243 | 3479 | 1811 | 2141 | 1650