#include <bits/stdc++.h>
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
  int n;
  cin >> n;
  vector<long long> a(n);
  int m1 = 0;
  int m4 = 0;
  int cnt = 0;
  for (long long i = 0; i < (n); ++i) {
    cnt = 0;
    cin >> a[i];
    for (long long j = 0; j < (2); ++j) {
      if (a[i] % 2 == 0 && a[i] != 0) {
        cnt++;
        a[i] /= 2;
      }
    }
    if (cnt == 2) m4++;
    if (cnt == 0) m1++;
  }
  if (n <= 3 && m4 >= 1) {
    cout << "Yes" << endl;
    return 0;
  }
  if (m1 <= m4)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
