#include <bits/stdc++.h>
const int mod = 1e9 + 7;
using namespace std;
long long n;
vector<long long> a;
string solve() {
  long long fc = 0;
  long long tc = 0;
  long long odd = 0;
  for (int i = 0; i < (n); i++) {
    if (a[i] % 4 == 0) {
      fc++;
    } else if ((a[i] % 2 == 0 && (a[i] / 2) % 2 == 0) || a[i] == 2)
      tc++;
    else if (a[i] % 2 == 1)
      odd++;
  }
  if ((odd % 2 == 0 ? odd : odd + 1) / 2 <= (fc - (tc > 0 ? 1 : 0)) ||
      tc == n) {
    return "Yes";
  } else {
    return "No";
  }
}
int main() {
  cin >> n;
  for (int i = 0; i < (n); i++) {
    long long x;
    cin >> x;
    a.push_back(x);
  }
  cout << solve() << endl;
  return 0;
}
