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