#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int Len(int n) {
  int s = 0;
  while (n != 0) s++, n /= 10;
  return s;
}
int Sint(int n) {
  int m = 0, s = 0, a = n;
  while (a != 0) s++, a /= 10;
  for (int i = s - 1; i >= 0; i--)
    m += n / ((int)pow(10, i)) - (n / ((int)pow(10, i + 1))) * 10;
  return m;
}
int GCD(int a, int b) {
  int r, tmp;
  if (a < b) {
    tmp = a;
    a = b;
    b = tmp;
  }
  r = a % b;
  while (r != 0) {
    a = b;
    b = r;
    r = a % b;
  }
  return b;
}
int Factorial(int n) {
  int m = 1;
  while (n >= 1) m *= n, n--;
  return m;
}
int Svec(vector<int> v) {
  int n = 0;
  for (int i = 0; i < v.size(); i++) n += v[i];
  return n;
}
int main() {
  int n;
  cin >> n;
  vector<int> v(n), w;
  for (int i = 0; i < (n); i++) cin >> v[i];
  for (int i = 0; i < (n); i++) {
    int cnt = 0;
    while (v[i] % 2 == 0 && v[i] != 0) {
      cnt++;
      v[i] /= 2;
    }
    w.push_back(cnt);
  }
  int a = 0, b = 0, c = 0;
  for (int i = 0; i < (w.size()); i++) {
    if (w[i] == 0) {
      a++;
    } else if (w[i] == 1) {
      b++;
    } else {
      c++;
    }
  }
  if ((n - b + 1) / 2 <= c) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
