def areEquivalent(num1,num2):
    import math 
    def divSum(n): 
        sum = 1; 
        i = 2; 
        while(i * i <= n): 
            if (n % i == 0): 
                sum = (sum + i +math.floor(n / i)); 
            i += 1; 
        return sum; 
     
    return divSum(num1) == divSum(num2); 
def areEquivalent(num1, num2):
    import math
    def divSum(n):
        sum = 1
        n2 = 2
        while n2 * n2 <= n:
           
            if n % n2 == 0:
                sum = sum + n2 + math.floor(n / n2)
            n2 += 1
        return sum
    return divSum(num1) == divSum(num2)