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