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.

Constraints

* 2 ≤ N ≤ 10^5
* a_i is an integer.
* 1 ≤ a_i ≤ 10^9

Input

Input is given from Standard Input in the following format:


N
a_1 a_2 ... a_N


Output

If Snuke can achieve his objective, print `Yes`; otherwise, print `No`.

Examples

Input

3
1 10 100


Output

Yes


Input

4
1 2 3 4


Output

No


Input

3
1 4 1


Output

Yes


Input

2
1 1


Output

No


Input

6
2 7 1 8 2 8


Output

Yes
N = input()
a = map(int, raw_input().split())

c1 = 0
c2 = 0
c4 = 0
for x in a:
  if x%4==0:
    c4 += 1
  elif x%2==0:
    c2 += 1
  else:
    c1 += 1

if c1>0:
  p = 1
  c1 -= 1
elif c2>0:
  p = 2
  c2 -= 1
else:
  p = 4
  c4 -= 1

while c1+c2+c4>0:
  if p==1:
    if c4>0:
      c4 -= 1
      p = 4
    else:
      print "No"
      break
  elif p==2:
    if c2>0:
      c2 -= 1
      p = 2
    elif c4>0:
      c4 -= 1
      p = 4
    else:
      print "No"
      break
  else:
    if c1>0:
      c1 -= 1
      p = 1
    elif c2>0:
      c2 -= 1
      p = 2
    else:
      c4 -= 1
      p = 4
else:
  print "Yes"
