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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {

	/**
	 * @param args
	 */

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String tmp = br.readLine();
		int n = Integer.parseInt(tmp);
		
		int[] input = new int[n];

		String[] tmpArray = br.readLine().split(" ");
		
		int numOf4Times = 0;
		int numOfOdd = 0;
		for(int i = 0; i < n; i++){
			input[i] = Integer.parseInt(tmpArray[i]);
			if(input[i] % 2 == 1){
				numOfOdd++;
			}
			else if(input[i] % 4 == 0){
				numOf4Times++;
			}
		}
		
		if(n % 2 == 1){
			if(numOfOdd - numOf4Times <= 1){
				System.out.println("Yes");
			}
			else{
				System.out.println("No");
			}
		}
		
		else {
			if(numOfOdd - numOf4Times <= 0){
				System.out.println("Yes");
			}
			else{
				System.out.println("No");
			}
		}

	}

}
