#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int, int>, int>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
long long gcd(long long a, long long b) {
  if (a % b == 0)
    return (b);
  else
    return (gcd(b, a % b));
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  cout << fixed << setprecision(15);
  long long N;
  cin >> N;
  vector<long long> A(N);
  long long c2 = 0;
  long long c4 = 0;
  for (long long i = 0; i < (long long)(N); ++i) {
    cin >> A[i];
    if (A[i] % 2 == 0) c2++;
    if (A[i] % 4 == 0) c4++;
  }
  c2 = c2 - c4;
  long long K = N - c2;
  if (c2 == 0) {
    if (K / 2 <= c4) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
    return 0;
  }
  if ((K - 1) / 2 < c4) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
