King Tle4Ever of Time Limit Exceeded is really fascinated about Tic Tac Toe. He organizes a national level contest for Tic Tac Toe every year in Time Limit Exceeded. (Though I agree you need to be really stupid to loose a game of Tic Tac Toe but for the sake of question assume playing Tic Tac Toe for them is same as playing Chess for us :P ). 
Every year the contest has lots of participants. This year there are n participants from all over the country. Seeing this huge participation he asks Moron a simple question.
Suppose participant pi wins wi matches. The king wants to know the sum of wi^2 from 1 to n. Now as you already know Moron is not good with maths, he asks you to help him.
Given the value of n find the minimum and maximum value of sum of wi^2 from 1 to n. As values can be too large output the values mod 10^9+7.
[Input]
First line contains a single integer t denoting number of test cases.
Next t lines contains a single integer n denoting the number of participants.

[Output]
For each test case output the minimum and maximum value mod 10^9+7. Say minimum is minx and maximum is maxx than you should print "minx maxx".
[Constraints]
1 ≤ t ≤ 10^5
3 ≤ n ≤ 10^9
NOTE : n will be an odd integer

SAMPLE INPUT
2
3
5

SAMPLE OUTPUT
3 5
20 30
#-------------------------------------------------------------------------------
# Name:        module1
# Purpose:
#
# Author:      onkar shandilya
#
# Created:     08/11/2014
# Copyright:   (c) onkar shandilya 2014
# Licence:     <your licence>
#-------------------------------------------------------------------------------

def find_min_max(T):
    a = 0
    while a < T:
        n = int(input())
        n1 = n-1
        mod = 1000000007
        matches = n1*(n1+1)/2
        min = int(((matches/n)*(matches/n)*n)%mod)
        max = int(((n1)*(n1+1)*(2*n1+1)/6)%mod)
        print (str(min) +' '+str(max))
        a = a+1

def main():
    T = int(input())
    find_min_max(T)
    pass

if __name__ == '__main__':
    main()