def find_ways(M):
	def bin_coff(n, r): 
		val = 1
		if (r > (n - r)): 
			r = (n - r) 
		for i in range(0, r): 
			val *= (n - i) 
			val //= (i + 1) 
		return val 
	 
	n = M // 2
	a = bin_coff(2 * n, n) 
	b = a // (n + 1) 
	return (b) 
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] 