#include <bits/stdc++.h>
using namespace std;
int i, n, a;
vector<int> afs;
bool nyan;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a;
    afs.push_back(a);
  }
  do {
    nyan = 1;
    for (i = 0; i < afs.size() - 1; i++) {
      long long int tmp = (afs[i] * afs[i + 1] * 1LL);
      if (tmp % 4 != 0) {
        nyan = 0;
        break;
      }
    }
    if (nyan) {
      puts("Yes");
      return 0;
    }
  } while (next_permutation(afs.begin(), afs.end()));
  puts("No");
  return 0;
}
