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;
template <class T>
T to_T(const string &s) {
  istringstream is(s);
  T res;
  is >> res;
  return res;
}
template <class T>
string to_s(const T &a) {
  ostringstream os;
  os << a;
  return os.str();
}
void solve(long long N, vector<long long> a) {
  int L[3] = {};
  int two = 0;
  for (int i = (0); i < (N); ++i) {
    if (a[i] == 2) two++;
    long long b = 0;
    if (a[i] % 2 == 0) {
      b = a[i] / 2;
      b = min(b, 2LL);
    }
    L[b]++;
  }
  vector<long long> ans;
  for (int j = (0); j < (3); ++j)
    if (L[j] > 0) {
      L[j]--;
      ans.push_back(j);
      break;
    }
  for (int i = 1; i < N; ++i) {
    bool flag = false;
    for (int j = (0); j < (3); ++j)
      if (L[j] > 0) {
        if (ans[i - 1] + j >= 2) {
          L[j]--;
          ans.push_back(j);
          flag = true;
          break;
        }
      }
    if (!flag) {
      cout << "No" << endl;
      return;
    }
  }
  cout << "Yes" << endl;
}
int main() {
  ios::sync_with_stdio(false);
  long long N;
  cin >> N;
  vector<long long> a(N - 1 + 1);
  for (int i = 0; i <= N - 1; i++) {
    cin >> a[i];
  }
  solve(N, a);
  return 0;
}
