#include <bits/stdc++.h>
using namespace std;
int tot[3];
int two(int n) {
  int res = 0;
  while (n && n % 2 == 0) res++, n /= 2;
  if (res <= 1) return res;
  return 2;
}
int main() {
  int n, a;
  cin >> n;
  if (n == 0) {
    puts("No");
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    cin >> a;
    tot[two(a)]++;
  }
  int sum = tot[2] ? tot[2] * 2 + 1 : 0;
  bool ok = 0;
  if (sum >= n) {
    ok = 1;
  }
  if (tot[0] >= sum - tot[2]) {
    tot[0] -= sum - tot[2];
    if (n - sum > 1 && tot[1] >= 2) {
      tot[1] -= 2;
      int lim = (n - sum - 2) % 3 + (n - sum - 2) / 3 * 2;
      if (tot[1] >= lim) {
        ok = 1;
      }
    }
  } else {
    ok = 1;
  }
  ok ? puts("Yes") : puts("No");
  return 0;
}
