#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010;
const int INF = 1000000000;
long long a[maxn];
int main() {
  int n, i;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  do {
    for (i = 0; i < n - 1; i++) {
      if (((a[i] % 4) * (a[i] % 4)) % 4 != 0) break;
    }
    if (i == n - 1) {
      printf("Yes");
      return 0;
    }
  } while (next_permutation(a, a + n));
  printf("No");
  return 0;
}
