For this Question: Given an integer array A of size N. Find the sum of GCD (Greatest Common Divisor) of all elements with their frequency.First line contains an integers N.
Next line contains N space separated integers denoting elements of array.

Constraints
1 <= N <= 1000
0 <= Ai<= 10^5Print the sum of GCD of all elements with their frequency.Sample Input 1:
3
1 2 3

Output 
3

Explanation:
gcd(1, 1) + gcd(2, 1) + gcd(3, 1) = 1+1+1 = 3

Sample Input 2:
6
3 6 6 9 3 3

Output 
14

Explanation
gcd(3, 3) + gcd(6, 2) + gcd(6, 2) + gcd(9, 1) + gcd(3, 3) + gcd(3, 3)= 3+2+2+1+3+3= 14, I have written this Solution Code: def computeGCD(a, b):
    if(b == 0):
        return a
    if(a==0):
        return b
    return computeGCD(b , a%b)


n = int(input())
l = [0]*n
l = list(map(int , input().strip().split(" ")))
c , g , t = 0 , 0 , 0
'''l_c = [0]*n
g,t = 0,0
for i in range(0,n):
    l_c[i] = l.count(l[i])'''
for i in l:
    c = l.count(i)
    g = computeGCD(c , i)
    t = t + g
'''for i in range(0,n):
    g  = computeGCD(l_c[i],l[i])
    t = t + g'''
print(t), In this Programming Language: Python, Now tell me if this Code is compilable or not?