#include <bits/stdc++.h>
using namespace std;
const int maxn = 10001;
int prime[maxn], pNum = 0;
bool p[maxn] = {0};
void Find_Prime() {
  for (int i = 2; i < maxn; i++) {
    if (p[i] == false) {
      prime[pNum++] = i;
      for (int j = i + i; j < maxn; j += i) {
        p[j] = true;
      }
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  int count = 0;
  for (int i = 0; i < n; i++) {
    int temp;
    scanf("%d", &temp);
    if (temp % 4 == 0)
      count += 2;
    else if (temp % 2 == 0)
      count += 1;
  }
  if (count >= n - 1)
    printf("Yes");
  else
    printf("No");
  return 0;
}
