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
import java.util.*;
import java.util.function.ToDoubleFunction;


public class Main {
//    private static final String ex = "3\n" +
//            "1 10 100";
    private static final String ex = "6\n" +
        "2 7 1 8 2 8";
//    private static final String ex = "2\n" +
//        "1 1";
//    private static final String ex = "3\n" +
//        "1 4 1";
//    private static final String ex = "4\n" +
//            "1 2 3 4";

    public static void main(String[] args) {
        solve(new Scanner(System.in));
//        solve(new Scanner(ex));
    }

    private static void solve(Scanner scanner) {
        Integer N = Integer.parseInt(scanner.nextLine());

        int even2 = 0;
        int even4 = 0;
        int odd = 0;
        String split[] = scanner.nextLine().split(" ");
        for (int i = 0; i < N; i ++) {
            int num = Integer.parseInt(split[i]);

            if (num % 2 == 1) {
                odd ++;
            } else if (num % 4 == 0) {
                even4 ++;
            } else {
                even2 ++;
            }
        }

        if (even2 > 0) odd ++;

        String result = odd > (even4 + 1) ? "No" : "Yes";

        System.out.println(result);
    }
}
