#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
long long int n, cnt = 0, ans = 0, a[10000000], b, c, cmp = 0, cmpp = 0, m, h,
                 w, x, y, sum = 0, pos;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl = true;
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  pos = n;
  for (long long int(i) = 0; (i) < (int)(n); (i)++) {
    cin >> a[i];
    if (a[i] % 4 == 0) {
      cmp++;
    } else if (a[i] % 2 == 0) {
      cmpp++;
    }
  }
  n -= cmpp / 2;
  if (n / 2 <= cmp || cmpp == pos) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  };
  return 0;
}
