#include <bits/stdc++.h>
int N;
int mark[100001];
int count = 0;
int a[100001];
bool flag = false;
void DFS(int tmp) {
  if (count == N) {
    flag = true;
    return;
  }
  for (int i = 0; i < N; i++) {
    if (mark[i] == 1 && ((tmp % 4) * (a[i] % 4)) % 4 == 0) {
      mark[i] = 0;
      count++;
      DFS(a[i]);
      mark[i] = 1;
      count--;
    }
    if (flag) return;
  }
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &a[i]);
    mark[i] = 1;
  }
  for (int i = 0; i < N; i++) {
    mark[i] = 0;
    count++;
    DFS(a[i]);
    mark[i] = 1;
    count--;
    if (flag) break;
  }
  if (flag)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
