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 count_ways(n):
	 
	A = [0] * (n + 1) 
	B = [0] * (n + 1) 
	A[0] = 1
	A[1] = 0
	B[0] = 0
	B[1] = 1
	for i in range(2, n+1): 
		A[i] = A[i - 2] + 2 * B[i - 1] 
		B[i] = A[i - 1] + B[i - 2] 
	return A[n] 