#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, flag = 0;
  cin >> n;
  int ara[n + 5];
  map<int, int> mp;
  vector<int> ve, ce;
  for (int i = 1; i <= n; i++) {
    cin >> ara[i];
  }
  for (int i = 1; i <= n; i++) {
    int a = ara[i] % 4;
    mp[a]++;
    if (a == 2) {
      ve.push_back(ara[i]);
    } else if (a == 3)
      ce.push_back(ara[i]);
  }
  sort(ve.begin(), ve.end());
  if (mp[0] || mp[2] > 1) {
    puts("Yes");
  } else {
    for (int i = 0; i < ve.size(); i++) {
      for (int j = 0; j < ce.size(); j++) {
        if ((ve[i] * ce[j]) % 4 == 0) {
          flag = 1;
          break;
        }
      }
      if (flag) break;
    }
    if (flag) {
      puts("Yes");
    } else
      puts("No");
  }
  return 0;
}
