#include <bits/stdc++.h>
using namespace std;
using ll = __int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
  int n;
  cin >> n;
  ll a[n];
  ll f = 0, t = 0;
  for (int(i) = 0; (i) < (n); (i)++) {
    cin >> a[i];
    if (a[i] % 4 == 0) {
      f++;
    } else if (a[i] == 2) {
      t++;
    }
  }
  if (t == 0) {
    if (f >= n / 2) {
      cout << "Yes" << endl;
      return;
    }
  } else {
    n -= (t / 2) * 2;
    if (f >= n / 2) {
      cout << "Yes" << endl;
      return;
    }
  }
  cout << "No" << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
