#include <bits/stdc++.h>
using namespace std;
const double pie = acos(-1.0);
const long long MOD = 1e9 + 7;
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; }
bool is_prime(const unsigned n) {
  switch (n) {
    case 0:
    case 1:
      return false;
    case 2:
    case 3:
      return true;
  }
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (unsigned i = 5; i * i <= n; i += 6) {
    if (n % i == 0) return false;
    if (n % (i + 2) == 0) return false;
  }
  return true;
}
void solve() {
  long long n;
  cin >> n;
  long long c1 = 0, c2 = 0, c4 = 0;
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    if (a == 2)
      c2++;
    else if (a % 2 == 1)
      c1++;
    else if (a % 4 == 0)
      c4++;
  }
  if (c2 == 0) {
    if (c4 + 1 >= c1)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  } else {
    if (c4 >= c1)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
