#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
long long a[M];
int main() {
  long long n, t;
  while (cin >> n) {
    int cnt = 0;
    for (int i = 0; i < n; ++i) scanf("%lld", a + i);
    sort(a, a + n);
    t = 1;
    for (int i = 0; i < n; ++i) {
      t *= a[i];
      t %= 4;
      cnt += t == 0;
    }
    if (cnt >= n / 2)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
