#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long one = 0, two = 0;
  for (long long i = 0; i < n; i++) {
    long long cnt = 0;
    for (long long j = 0; j < n; j++) {
      if (i == j) continue;
      if (a[i] * a[j] % 4 == 0) cnt++;
    }
    if (cnt == 1)
      one++;
    else if (cnt >= 2)
      two++;
  }
  if (one == 2 && two == n - 2 || one == 1 && two == n - 1 || two == n) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
