Given an integer N, find the sum of GCD(i, N) where i = 1 to N. GCD denotes the greatest common divisor. Provide the answer modulus 10^9 + 7.
The first line of the input contains an integer T denoting the number of test cases. Then T test cases follow. Each test cas consists of a single line containing an integer N.
For each test case, output the sum in seperate line.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.