output_description: If Snuke can achieve his objective, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_N
attempt: N = int(input())
  a = list(map(int,input().split()))
  one = 0
  four = 0
  two = 0
  
  for j in range(N):
  
    if a[j]%2 == 1:
      one += 1
    elif a[j]%4 == 0:
      four += 1
    else :
      two +=1
  
    
  if one =< four:
    print('Yes')
  else :
    if (two == 0 and four == one -1):
       print('Yes')
    else:
      print('No')
problem_description: Statement
  
  We have a sequence of length N, a = (a_1, a_2, ..., a_N). Each a_i is a
  positive integer.
  
  Snuke's objective is to permute the element in a so that the following
  condition is satisfied:
  
    * For each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.
  
  Determine whether Snuke can achieve his objective.
samples: [{"input": "3\n    1 10 100", "output": "Yes\n    \n\nOne solution is (1, 100, 10).\n\n* * *"}, {"input": "4\n    1 2 3 4", "output": "No\n    \n\nIt is impossible to permute a so that the condition is satisfied.\n\n* * *"}, {"input": "3\n    1 4 1", "output": "Yes\n    \n\nThe condition is already satisfied initially.\n\n* * *"}, {"input": "2\n    1 1", "output": "No\n    \n\n* * *"}, {"input": "6\n    2 7 1 8 2 8", "output": "Yes"}]