#include <bits/stdc++.h>
using namespace std;
int n, f;
int b[100001];
int a[100001];
bool used[100001];
void dfs(int s) {
  if (s < n + 1 && a[s] * a[s - 1] % 4 != 0) return;
  if (s == n + 1) {
    f = 1;
  } else {
    for (int i = 1; i <= n; i++)
      if (used[i] == 0 && (b[i] * a[s - 1]) % 4 == 0) {
        a[s] = b[i];
        used[i] = 1;
        dfs(s + 1);
        used[i] = 0;
      }
  }
}
int main() {
  cin >> n;
  f = 0;
  for (int i = 1; i <= n; i++) cin >> b[i];
  dfs(1);
  if (f)
    printf("Yes");
  else
    printf("No");
}
