#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
long long lcm(long long x, long long y) { return x / GCD(x, y) * y; }
int main() {
  int N;
  cin >> N;
  vector<long long> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  long long ans = 0;
  int count = 0;
  for (int i = 0; i < N; i++) {
    if (A[i] % 4 == 0) {
      ans += 2;
      continue;
    }
    if (A[i] % 2 == 0) {
      count++;
      if (count == 2) {
        ans++;
        count = 0;
      }
    }
  }
  if (ans < N - 1)
    cout << "No" << endl;
  else
    cout << "Yes" << endl;
  return 0;
}
