#include <bits/stdc++.h>
int main() {
  int queue[100010] = {0}, n = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &queue[i]);
  }
  int best = 0, good = 0, bad = 0;
  for (int i = 0; i < n; i++) {
    if (queue[i] % 4 == 0)
      best++;
    else if (queue[i] % 2 == 0)
      good++;
    else
      bad++;
  }
  best = best + 1 - bad;
  if (best < 0)
    printf("No");
  else if (best == 0 && good == 1)
    printf("No");
  else
    printf("Yes");
  return 0;
}
