#include <bits/stdc++.h>
using namespace std;
long long s, n, m, a[100001], dp[100001];
int main() {
  int i, j;
  cin >> n;
  dp[0] = 1000000;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (a[i] * a[j] % 4 == 0 && i != dp[i - 1] && j != dp[i - 1]) {
        m++;
        dp[i] = j;
        break;
      } else {
        dp[i] = dp[i - 1];
      }
    }
  }
  if (m >= n) {
    cout << "Yes";
  } else {
    cout << "No";
  }
  return 0;
}
