#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N];
bool used[N];
int k[N];
int n;
int h = 0;
void dfs(int step) {
  if (step == n + 1) {
    int p;
    for (p = 1; p <= n - 1; p++) {
      if ((k[a[p]] * k[a[p + 1]]) % 4 == 0)
        continue;
      else
        break;
    }
    if (p == n) {
      h = 1;
      return;
    }
  } else {
    for (int i = 1; i <= n; i++) {
      if (!used[i]) {
        a[step] = i;
        used[i] = true;
        dfs(step + 1);
        used[i] = false;
      }
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> k[i];
  }
  memset(used, 0, sizeof(used));
  dfs(1);
  if (h == 1)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
