#include <bits/stdc++.h>
const int INF = 1 << 30;
const int V = 10;
struct edge {
  int to, cost;
};
std::vector<edge> v[100];
int main() {
  int n, a[100000];
  std::cin >> n;
  for (int i = 0; i < n; i++) {
    std::cin >> a[i];
  }
  int ans = n;
  for (int i = 0; i < n; i++) {
    if (a[i] % 2 == 0) {
      if (a[i] / 2 % 2 == 0) {
        ans -= 3;
      }
    }
  }
  if (ans <= 0) {
    std::cout << "Yes" << std::endl;
  } else {
    int nSum = 0;
    for (int i = 0; i < n; i++) {
      if (a[i] % 2 == 0) {
        if (a[i] / 2 % 2 != 0) {
          nSum += 1;
        }
      }
    }
    if (nSum % 2 == 0) {
      ans -= nSum / 2;
    } else {
      ans -= nSum / 2;
    }
    if (ans <= 0) {
      std::cout << "Yes" << std::endl;
    } else {
      std::cout << "No" << std::endl;
    }
  }
  return 0;
}
