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.Scanner;

public class Main {
    
    public static void main(String[] args) {
        
        new Main().q1();
    }
    
    
    public void q1() {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
       
        int ni=0;
        int yon=0;
        int zero=0;
        
        
        for(int i = 0; i < n; i++) {
           long in = sc.nextLong();
           if(in%4==0){
               yon++;
           }else if(in %2 == 0){
               ni++;
           }else{
               zero++;
           }
        }

        //二の倍数は二個並べればOK
        //ni = ni%2;
        //zaroは4が同じ数以上あればOK
        //もし2が一つもなければ4を一つ稼げる
        if(ni==0){
            yon++;
        }
        if(zero > yon){
            System.out.println("No");
        }else{
            System.out.println("Yes");
        }
        
        
        
    }
    
    
}

