For this Question: There is a function F defined as,
F(x) = GCD(1, x) + GCD(2, x) +. . + GCD(x, x)
Your task is to find F(x), for the given x.First line contain integer T denoting number of test cases.
Next t lines contain an integer x. 

Constraints 
1 <= T <= 20000
1 <= x <= 100000For each test case print F(n) in separate lineSample Input
5
1
2
3
4
5

Sample output
1
3
5
8
9, I have written this Solution Code: def getCount(d,n):
    no = n // d
    result = no
    p=2
    while(p * p <= no):
        if(no % p == 0):
            while(no % p == 0):
                no = no // p
            result = result - (result // p)
        p += 1    
    if(no > 1):
        result = result - (result // no)
    return result

def getSumOfGCDOfPairs(n):
    result = 0
    i =1
    while(i * i <= n):
        if(n % i == 0):
            d1 = i
            d2 = n // i

            result = result + (d1 * getCount(d1, n))

            if(d1 != d2):
                result = result + (d2 * getCount(d2, n))
        i += 1        
    return result
k = int(input())
for i in range(k):
    n = int(input())
    sum1 = 0
    sum1 = getSumOfGCDOfPairs(n)
    print(sum1), In this Programming Language: Python, Now tell me if this Code is compilable or not?