#include <bits/stdc++.h>
using namespace std;
const long long max1 = 11;
const long long max2 = 102;
const long long max3 = 1003;
const long long max4 = 10004;
const long long maxx = 100005;
const long long max6 = 1000006;
const long long max7 = 10000007;
const long long lg2 = 7;
const long long lg3 = 10;
const long long lg4 = 13;
const long long lg5 = 17;
const long long lg6 = 20;
const long long lg7 = 24;
const long long lg8 = 27;
const long long lg9 = 30;
const long long lg18 = 60;
const long long INF = 2LL * 1000000000;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b) b ^= a ^= b ^= a %= b;
  return a;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long is_prime(long long n) {
  if (n == 1) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  for (long long i = 3; i <= sqrt(n); i += 2)
    if (n % i == 0) return 0;
  return 1;
}
long long is_integer(double n) {
  if (floor(n) == ceil(n)) return 1;
  return 0;
}
long long sto_int(string s) {
  stringstream ss(s);
  long long n;
  ss >> n;
  return n;
}
string to_string(long long n) {
  stringstream ss;
  ss << n;
  string s = ss.str();
  return s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  ;
  long long n, x;
  cin >> n;
  long long odd = 0, even = 0, r4 = 0;
  for (long long i = 1; i <= n; i++) {
    cin >> x;
    if (x % 2 == 1) odd++;
    if (x % 2 == 0) even++;
    if (x % 4 == 0) r4++;
  }
  if (r4 >= odd || r4 >= odd - 1 && even == 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
