#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
const int MAX_V = 201;
long long dp[2][4];
int now = 0;
int t[3];
void adjacent() {
  int n;
  cin >> n;
  long long a[100010];
  for (size_t i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] % 4 == 0) {
      t[2]++;
    } else if (a[i] % 2 == 0) {
      t[1]++;
    } else
      t[0]++;
  }
  int p = -1;
  for (int i = 0; i < n; i++) {
    if ((p == -1 && t[0] > 0) || (p == 2 && t[0] > 0)) {
      p = 0;
      t[0]--;
    } else if ((p == -1 && t[2] > 0) || t[2] > 0) {
      p = 2;
      t[2]--;
    }
  }
  if (t[0] > 0 || (p == 0 && t[1] == 1)) {
    cout << "No" << endl;
  } else
    cout << "Yes" << endl;
}
int main() {
  adjacent();
  return 0;
}
