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.
# C - 4-adjacent

N = int(input())
a = list(map(int, input().split()))

a_4_multi, a_2_multi, a_odd = [], [], []

for x in a:
    if x%2 == 1:
        a_odd.append(x)
    elif x%4 != 0:
        a_2_multi.append(x)
    else:
        a_4_multi.append(x)
        
if len(a_odd) - 1 <= len(a_4_multi) and len(a_2_multi)%2 == 0:
    print("Yes")
else:
    print("No")
# C - 4-adjacent

N = int(input())
a = list(map(int, input().split()))

a_4_multi, a_2_multi, a_odd = [], [], []

for x in a:
    if x%2 == 1:
        a_odd.append(x)
    elif x%4 != 0:
        a_2_multi.append(x)
    else:
        a_4_multi.append(x)
        
sort_a = []
for idx in range(N):
    if idx%2 == 0 and len(a_odd) >= 1:
        sort_a.append(a_odd.pop())
    elif idx%2 == 1 and len(a_4_multi) >= 1:
        sort_a.append(a_4_multi.pop())
    elif len(a_odd) == 0 and len(a_4_multi) >= 1:
        sort_a.append(a_4_multi.pop())
    elif len(a_odd) >= 1 and len(a_4_multi) == 0:
        sort_a.append(a_odd.pop())
    else:
        sort_a.extend(a_2_multi)
        break

for idx in range(N-1):
    if (sort_a[idx] * sort_a[idx+1])%4 != 0:
        print("No")
        exit()

print("Yes")