#include <bits/stdc++.h>
using namespace std;
long long GCD(long long x, long long y) { return y ? GCD(y, x % y) : x; }
int main() {
  long long N;
  cin >> N;
  int cnt = 0;
  vector<long long> a(N);
  for (long long i = 0; i < N; ++i) cin >> a[i];
  for (long long i = 0; i < N; ++i)
    if (a[i] % 4 == 0) cnt++;
  if (N % 3 == 0) {
    if (N / 3 <= cnt)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  } else {
    if (N / 2 <= cnt)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
