#include <bits/stdc++.h>
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
using P = pair<int, int>;
using ll = long long;
const ll INF = 1LL << 60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  vector<int> counter(2);
  for (int i = 0; i < (n); ++i) {
    int x;
    cin >> x;
    if (x % 4 == 0) {
      counter[0]++;
    } else if (x % 2 == 0) {
      counter[1]++;
    }
  }
  if (counter[0] == n || counter[1] == n) {
    cout << "Yes" << endl;
    return 0;
  }
  if (counter[1] > 1) {
    n -= (counter[1] - 1);
  }
  n -= (counter[0] + (counter[0] * 2));
  if (n <= 0) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
