#include <bits/stdc++.h>
using namespace std;
long long int isPrime(int n) {
  if (n <= 1) return 1;
  if (n <= 3) return 2;
  if (n % 2 == 0 || n % 3 == 0) return 1;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 1;
  return 2;
}
long long int fact(long long int n) {
  long long int res = 1;
  for (long long int i = 2; i <= n; i++) res = res * i, res %= 1000000007;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    long long int n, c = 0, d = 0;
    cin >> n;
    long long int A[n];
    for (long long int i = 0; i < n; i++) {
      cin >> A[i];
      if (A[i] % 4 == 0) c++;
      if (A[i] % 2 == 0) d++;
    }
    if (c >= n / 2)
      cout << "Yes";
    else {
      if (d >= n - 2 * c)
        cout << "Yes";
      else
        cout << "No";
    }
  }
  return 0;
}
