#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
inline void chmin(T &t, U f) {
  if (t > f) t = f;
}
template <class T, class U>
inline void chmax(T &t, U f) {
  if (t < f) t = f;
}
int n, m, v, i;
void solve() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  long long l, cnt[4] = {0};
  for (int i = (int)(0); i < (int)(n); i++) {
    cin >> l;
    cnt[l % 4]++;
  }
  long long sum = cnt[1] + cnt[2] + cnt[3];
  if (sum <= cnt[0] * 2 || (cnt[2] - cnt[1] - cnt[3] - cnt[4]) == cnt[2])
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
int main() {
  solve();
  return 0;
}
