CRDS - Cards

Maricruz have a lot of cards, she always uses her cards to build pyramids as shown in the following image:

Cards

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

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

hide comments
2015-12-26 13:44:54
AC , Thinking about the problem and forget Modulus ;) cheers
2015-12-19 13:12:32
First attempt got TLE for Brute Force .. changed approach and got 3 WA for not having long long int in place of int. Finally AC. B|
2015-12-19 12:49:48
@Satish Brute Force would give you a TLE. Think of a simpler way which does not need to include the for loop. Think of a simpler equation. :)
2015-12-10 11:25:52 satish
My solution is getting wrong answer.However I am getting correct answer in my IDE and Ideone.
My solution -
http://ideone.com/eZtqyV
2015-11-29 13:22:03
@marcipanko, because the result is bigger than 1000007....in addition, because the formula contains N*(N+...)

Last edit: 2015-11-29 13:22:36
2015-11-12 22:25:42
I don't understand why is N%1 000 007 important if N < 1 000 007 so N%1 000 007 = N.
Explanation please?
2015-10-26 12:37:17
Don't Forget MOD 1000007.
2015-09-25 19:28:38
2 WAs because i forgot to mod by 1000007 :'(
2015-09-13 23:03:14
easy one :) simple maths....silly mistake gave me 1 WA :-p
2015-08-28 12:20:25
easy question...but a silly mistake caused me 6 wrong answer
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.