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 =input()
a =input().split()
b,c,d =0,0,0
for i in range(0,int(N)-1):
    hoge = int(a[i])%2
    if hoge ==0:
        b =b+1
for i in range(0,int(N)-1):
    hoge = int(a[i])%4
    if hoge ==0:
        c =c+1
d = b-c
if int(N)-3*c-d <=0:
    print('Yes')
else:
    print('No')

N =input()
a =input().split()
b,c,d =0,0,0
for i in range(0,int(N)):
    hoge = int(a[i])%2
    if hoge ==0:
        b =b+1
for i in range(0,int(N)):
    hoge = int(a[i])%4
    if hoge ==0:
        c =c+1
d = b-c
if d ==0:
    if c-(int(N)-b)+1>=0:
        print('Yes')
    else:
        print('No')
else:
    if c-(int(N)-b)>=0:
        print('Yes')
    else:
        print('No')
