#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long x) {
  if (a < 0) a += MOD;
  long long ans = 1;
  while (x > 0) {
    if (x & 1) ans = ans * a % MOD;
    a = a * a % MOD;
    x >>= 1;
  }
  return ans;
}
long long gyaku(long long n) { return modpow(n, MOD - 2); }
signed main() {
  long long n;
  cin >> n;
  long long four = 0, two = 0, ki = 0;
  for (long long i = 0; i < (long long)(n); i++) {
    long long t;
    cin >> t;
    if (t % 4 == 0)
      four++;
    else if (t % 2 == 0)
      two++;
    else
      ki++;
  }
  if (two + four == n || four * 2 >= (two + ki))
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
