#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
long long gcd(long long x, long long y) {
  if (x % y == 0) return y;
  return gcd(y, x % y);
}
long long LCM(int a, int b) { return a * b / gcd(a, b); }
int main(void) {
  int n;
  cin >> n;
  vector<long long> a(n);
  int four = 0, two = 0, other = 0;
  for (int i = 0; i < (int)n; ++i) {
    cin >> a[i];
    if (a[i] % 4 == 0)
      four++;
    else if (a[i] == 2)
      two++;
    else
      other++;
  }
  n -= two;
  if (two) {
    if (n % 2) {
      if (four > other)
        cout << "Yes" << endl;
      else
        cout << "No" << endl;
    } else {
      if (four >= other)
        cout << "Yes" << endl;
      else
        cout << "No" << endl;
    }
  } else {
    if (abs(four - other) <= 1)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
