#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, f, cnt;
  scanf("%lld", &n);
  vector<int> s;
  int h;
  for (int i = 1; i <= n; i++) {
    cin >> h;
    s.push_back(h);
  }
  sort(s.begin(), s.end());
  do {
    cnt = 0;
    for (int i = 0; i < n - 1; i++) {
      if ((s[i] * s[i + 1]) % 4 == 0) {
        cnt++;
      }
    }
    if (cnt == n - 1) {
      cout << "Yes";
      return 0;
    }
  } while (next_permutation(s.begin(), s.end()));
  if (cnt < 4) cout << "No";
  return 0;
}
