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.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {

		public static void main(String[] args){
			 int sum ;
			
			Scanner sc = new Scanner(System.in);
			// 整数の入力
			// スペース区切りの整数の入力
			int a = sc.nextInt();

			ArrayList<Integer> stateList = new ArrayList<Integer>();
					
			int cnt4 = 0;
			int cnt2 = 0;
			int work = 0;
			for (int i = 0; i < a;i ++ ){
				stateList.add(sc.nextInt());
				work = stateList.get(i) % 4;
				if (work == 0){
					cnt4 ++ ;
				}else{
					work = stateList.get(i) % 2;
					if (work == 0){
						cnt2 ++ ;
					}
				}
			}
			
			work = a / 2;
			if (work <= cnt4){
				System.out.println("Yes");
				return;
			}
			
			work = a - ( cnt4 * 2 );
			if ((work == 0) | ( cnt2 == 0)){
				System.out.println("No");
				return;
			}
			if (work == cnt2){
				System.out.println("Yes");
				return;
			}
			 
			// 出力
			System.out.println("No");
		}
}
