def get_coordinates(test_tup):
  def adjac(ele, sub = []): 
    if not ele: 
       yield sub 
    else: 
       yield from [idx for j in range(ele[0] - 1, ele[0] + 2) 
                  for idx in adjac(ele[1:], sub + [j])] 
  
  res = list(adjac(test_tup))
  return (res) 
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] 