p03637 AtCoder Beginner Contest 069 - 4-adjacent
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
```python
N=int(input())
a=list(map(int,input().split()))
odd=0
m2=0
m4=0
for n in a:
    if n%2==1:
        odd+=1
    elif n%4!=0:
        m2+=1
    else:
        m4+=1
if m4>=odd or (m2==0 and m4>=odd-1):
    print('Yes')
else:
    print('No')

```