#include <bits/stdc++.h>
using namespace std;
int INF = -100;
int n;
int b[100001], a[100001], c[100001];
int dfs(int k) {
  if (k == n) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
      if (c[i] != b[i]) ans++;
    }
    if (ans <= 2) return 1;
    return 0;
  }
  for (int i = 1; i < n; i++) {
    if (a[i] != INF)
      if ((a[i] * b[k - 1]) % 4 == 0) {
        b[k] = a[i];
        int sign = a[i];
        a[i] = INF;
        if (dfs(k + 1)) {
          return 1;
        }
        a[i] = sign;
      }
  }
  return 0;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    c[i] = a[i];
  }
  b[0] = a[0];
  if (dfs(1))
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
