#include <bits/stdc++.h>
using namespace std;
int N, a[100000];
int recursion(int now, int before, map<int, bool> used) {
  bool res = false;
  if (now == N - 1) return true;
  for (int i = 0; i < N; i++) {
    if (used[i]) continue;
    if ((before * a[i]) % 4 != 0) continue;
    used[i] = true;
    res |= recursion(now + 1, a[i], used);
    used[i] = false;
  }
  return res;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> a[i];
  for (int i = 0; i < N; i++) {
    map<int, bool> used;
    used[i] = true;
    if (recursion(0, a[i], used)) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}
