#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
long long a[maxn];
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  long long d = 0, k = 0;
  for (long long i = 1; i <= n; i++) {
    if (a[i] % 4 == 0) d++;
    if (a[i] % 2 == 0 && a[i] % 4 != 0) k++;
  }
  long long p;
  if (d != 0)
    p = n - d * 2 - 1;
  else
    p = n;
  if (p < k)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
