#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using pq = priority_queue<int>;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  int f = 0;
  int w = 0;
  int z = 0;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
    if (a[i] % 4 == 0)
      f++;
    else if (a[i] == 2)
      w++;
    else if (a[i] == 0)
      z++;
  }
  if (z) {
    cout << "No" << endl;
    return 0;
  }
  int sum = f + (w / 2);
  if (sum >= n / 2 && f > 0)
    cout << "Yes" << endl;
  else if (w == n)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
