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 INF = 1001001001;
const long long LINF = 1e18;
const string endstr = "\n";
template <typename T>
T gcd(T a, T b) {
  return (a == 0) ? b : gcd(b % a, a);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
bool p_comp_fs(const pair<int, int> p1, const pair<int, int> p2) {
  return p1.first < p2.first;
};
bool p_comp_fg(const pair<int, int> p1, const pair<int, int> p2) {
  return p1.first > p2.first;
};
bool p_comp_ss(const pair<int, int> p1, const pair<int, int> p2) {
  return p1.second < p2.second;
};
bool p_comp_sg(const pair<int, int> p1, const pair<int, int> p2) {
  return p1.second > p2.second;
};
template <typename T>
vector<T> uniquen(vector<T> vec) {
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  return vec;
}
int main() {
  long long N;
  cin >> N;
  vector<long long> as(N, 0);
  long long f = 0, t = 0;
  for (long long i = 0; i < N; i++) {
    long long a;
    cin >> a;
    if (a % 4 == 0)
      f++;
    else if (a % 2 == 0)
      t++;
  }
  long long idx = -1 + 2 * f + t;
  cout << (idx >= N ? "Yes" : "No") << endstr;
  return 0;
}
