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 long double EPS = 1e-9;
const long long mod = 1e9 + 7;
const long long INF = mod * mod;
const long long MAX_N = 100000;
int main(void) {
  long long n;
  long long a[MAX_N];
  std::map<long long, long long> cnt;
  cin >> (n);
  for (long long((i)) = 0; ((i)) < ((n)); ((i))++) cin >> (a[(i)]);
  cnt[0] = 0;
  cnt[1] = 0;
  cnt[2] = 0;
  cnt[3] = 0;
  for (long long(i) = 0; (i) < (n); (i)++) cnt[a[i] % 4]++;
  if ((cnt[0] >= cnt[1] + cnt[3]))
    cout << ("Yes") << endl;
  else
    cout << ("No") << endl;
  ;
  return 0;
}
