#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
using ll = long long;
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
  unsigned r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}
int main() {
  int N;
  cin >> N;
  vector<ll> a(N);
  for (int i = 0, i_len = (N); i < i_len; ++i) cin >> a.at(i);
  ll four = 0, two = 0, odd = 0;
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    if (a.at(i) % 4 == 0)
      four++;
    else if (a.at(i) % 4 != 0 && a.at(i) % 2 == 0)
      two++;
    else if (a.at(i) % 2 == 1)
      odd++;
  }
  if (odd == 0)
    cout << "Yes" << endl;
  else if (four >= odd)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
