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 = 4
# ARR = [1, 2, 3, 4]
#
# N = 3
# ARR = [1, 10, 100]
#
# N = 3
# ARR = [1, 4, 1]
#
# N = 2
# ARR = [1, 1]
#
# N = 6
# ARR = [2, 7, 1, 8, 2, 8]

N = int(input())

ARR = [int(s) for s in input().split(" ")]
def calculate(n,arr):
    m1 = 0
    m2 = 0
    m3 = 0
    for ar in arr:
        if ar % 4 == 0:
            m1 = m1 + 1
        elif ar % 2 == 0:
            m2 = m2 + 1
        else:
            m3 = m3 + 1

    if m1 > 0:
        if m1 * 2 < m2 + m3:

            if m1 * 2 < m3:
                print("No")
                return
            else:
                if m1 * 2 - m3 < m2:
                    s = m1 * 2 - m3  - m2
                    if s % 2 == 0:
                        print("Yes")
                        return
                    else:
                        print("No")
                        return
    else:
        if m3 > 0:
            print("No")
            return

        if m2 % 2 == 1:
            print("No")
            return

    print("Yes")


calculate(N,ARR)
