#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}
const long double EPS = 1e-9L;
inline int sgn(const long double &r) { return (r > EPS) - (r < -EPS); }
inline long double sq(long double x) { return sqrt(max(x, 0.0L)); }
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
vector<int> r(4, 0);
int main() {
  int N;
  cin >> N;
  long long a[N];
  for (int i = 0; i < N; ++i) {
    cin >> a[i];
    r[a[i] % 4]++;
  }
  if (2 * r[0] >= r[1] + r[3] + r[2]) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
