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 int64_t MOD = 1e9 + 7;
int main() {
  int64_t n, m;
  cin >> n;
  vector<long> a(n);
  long num4 = 0;
  long num2 = 0;
  long num0 = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] % 4 == 0) num4++;
    if (a[i] % 4 != 0 && a[i] % 2 == 0) num2++;
    if (a[i] % 4 != 0 && a[i] % 2 != 0) num0++;
  }
  long ans = 0;
  num4 += num2 / 2;
  num0 += num2 % 2;
  if (n % 2 == 0) {
    cout << (num0 <= num4 ? "Yes" : "No") << endl;
  } else {
    cout << (num0 - 1 <= num4 ? "Yes" : "No") << endl;
  }
  return 0;
}
