#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<long long int, long long int>;
bool operator<(const ipair a, const ipair b) { return a.first < b.first; };
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
int main() {
  int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < (n); ++i) cin >> a[i];
  int cnt2 = 0, cnt4 = 0;
  for (long long int i = 0; i < (n); ++i) {
    if (a[i] % 2 == 0 && a[i] % 4 != 0)
      cnt2++;
    else if (a[i] % 4 == 0)
      cnt4++;
  }
  if (n - 3 * cnt4 <= 0) {
    cout << "Yes";
  } else if (n - 3 * cnt4 + 1 <= cnt2) {
    cout << "Yes";
  } else
    cout << "No";
  return 0;
}
