CRDS  Cards
Maricruz have a lot of cards, she always uses her cards to build pyramids as shown in the following image:
A pyramid card of 3 levels. She always wonder how many cards does she need to make a pyramid card of N levels. Your task is to answer that question.
Input
The first line of the input contains an integer 1 <= T <= 1,000. Each of the following T lines will have an integer 1 <= N <= 1,000,000.
Output
For each case, output a single line consisting of the number of cards needed to build a pyramid card of level N modulo 1,000,007.
Example
Input Example 2 3 7 Output Example 15 77
hide comments
nikhil03:
20160830 20:02:43
Taking n as long int will give unexpectedly give you WA!!! Use long long..


epsilonalpha:
20160815 15:03:45
First I thought that the modulo is the general 10^9+7 so that costed me two WA, and then three WA for choosing int. Stupid me. 

rachsbodla:
20160727 19:02:31
very easy problem.AC in one go :)


baadshah_:
20160622 17:32:53
AC in one go (Simple AP)


vineetpratik:
20160612 13:13:26
took N as int got WA took long long int. AC! 

sonali9696:
20160531 10:29:44
the output line means print ans modulo 1,000,007, "N modulo 1,000,007" makes no sense. Cost me 1 WA :/ 

vaibhavk31:
20160527 15:41:10
use long long int in place of of int


vinu0103:
20160508 12:40:56
thanks tony t


abhilc:
20160424 08:45:18
Arithmetic Progression :) 

adi_tdkr:
20160402 09:55:05
What is the meaning of this lines:

Added by:  Paulo Costa 
Date:  20120130 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  UGTO 