#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
const double pi = acos(-1.0);
long long n, m, d, x;
long long a[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int ans = 1;
  do {
    int i;
    for (i = 0; i < n - 1; i++) {
      if (a[i] * a[i + 1] % 4 == 0)
        continue;
      else
        break;
    }
    if (i == n - 1) ans = -1;
  } while (next_permutation(a, a + n));
  if (ans == -1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
