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
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = (int)(1e5 + 5);

using ll = long long int;

int n;
ll a[MAX_N];

int over2;
int just1;
int just0;

int main(void){
  // Here your code !
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%lld\n", &(a[i]));
  }

  for (int i = 0; i < n; ++i) {
    int cnt = 0;
    while (true) {
      if (a[i] % 2 == 0) {
        a[i] /= 2;
        cnt += 1;
      }
      else {
        if (cnt >= 2) {
          over2 += 1;
        }
        else if (cnt == 1) {
          just1 += 1;
        }
        else {
          just0 += 1;
        }

        break;
      }
    }
  }

  int threshold = (n % 2 == 0) ? n / 2 : (n - 1) / 2;

  if ((just1 + over2 + over2) >= n)) {
    // cout << over2 << "_" << threshold << "_" << over1 << endl;
    printf("Yes\n");
  }
  else printf("No\n");

  return 0;
}
