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.
N = int(input())
a=[int(x) for x in input().split()]
print(a)
Kisuu = 0
YonBaisuu = 0

for j in range(N):


  if a[0]%2 == 1:
    Kisuu += 1
    a.pop(0)
  elif a[0]%4 == 0:
    YonBaisuu += 1
    a.pop(0)
  else :
   a.pop(0)

if Kisuu == YonBaisuu:
  print('Yes')
else :
  print('No')


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 or (two == 0 and four == one -1):
  print('Yes')

else:

  print('No')