#include <bits/stdc++.h>
using namespace std;
long long GCD(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return GCD(y, x % y);
}
const int MOD = 1000000007;
int main() {
  int n;
  cin >> n;
  int cnt1 = 0;
  int cnt2 = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a == 2) {
      cnt2++;
    }
    if (a % 4 == 0) {
      cnt1++;
    }
  }
  if (n / 2 <= (cnt2 / 2) + cnt1) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
