#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const int MOD = 1000000007;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int n, a[10005], zero, one, four;
bool flag = false;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < (n); i++) {
    cin >> a[i];
    int x = a[i];
    if (x % 4 == 0)
      four++;
    else if (x % 2 == 0)
      one++;
    else
      zero++;
  }
  if (n % 2 == 0) {
    zero -= four;
    if (zero <= 0) flag = true;
  } else {
    four += one / 2;
    if (zero / four <= 3) flag = true;
  }
  if (flag)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
