#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-8;
int n;
long long a[maxn];
vector<int> s1, s2, s3;
bool solve() {
  int nm = 0;
  if (s2.size() == 0)
    nm = s1.size() + 1;
  else {
    nm = s1.size();
  }
  if ((int)s3.size() > nm) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  while (cin >> n) {
    s1.clear();
    s2.clear();
    s3.clear();
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] % 4 == 0)
        s1.push_back(a[i]);
      else if (a[i] % 2 == 0)
        s2.push_back(a[i]);
      else {
        s3.push_back(a[i]);
      }
    }
    if (solve()) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
