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
ramesh_961:
20170603 11:31:44
Nice one! Mat be the reason for using Long Long is for ex: For integers P,Q (P*Q), may result in Long Long and and that result will be Long Long only if P and Q are Long Long! After that applying MOD may yield correct results..


nilabja16180:
20170215 14:32:01
Not taking long long costed me two WA :( 

shivendra_420:
20170207 13:19:33
unable to understand why long int is giving wrong ans.....but long long gives AC although constraints are satisfied by long int


vengatesh15:
20170119 18:35:47
1 line code... AC in 1 go 

soodan:
20161226 14:16:26
hint : learn about triangular numbers and formula for sum of 1+ 2+ 3...n . 

soodan:
20161226 14:03:31
bottom up dp 

apurvgs:
20161214 06:24:39
very easy one...........AC in one go......


syed_tanveer:
20161119 16:47:44
One liner in python. :). AC in a go. 

narutohokage_1:
20161024 20:05:55
took N as int got WA took long long int. AC!


kash08rock:
20161010 17:06:01
dont take mod while calculating.. take it once only at the end. cost me 2 WA :/

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 