#include <bits/stdc++.h>
using namespace std;
template <typename T>
void fill_all(T& arr, const T& v) {
  arr = v;
}
template <typename T, typename ARR>
void fill_all(ARR& arr, const T& v) {
  for (auto& i : arr) {
    fill_all(i, v);
  }
}
long long int combination(long long int n) {
  long long int nck[100][100];
  nck[0][0] = 1;
  for (int i = 1; i < 1 + n; i++) {
    nck[i][0] = nck[i][i] = 1;
    for (int j = 1; j < i; j++) {
      nck[i][j] = nck[i - 1][j - 1] + nck[i - 1][j];
    }
  }
  return 0;
}
long long int n, m, a, b, k, d, c;
;
vector<vector<long long int>> way(2001), money(2001);
long long int maxa = 0, moto = 0;
long long int retu[11451] = {};
queue<long long int> q;
long long int bitmax = 0;
int main() {
  long long int n;
  cin >> n;
  long long int four = 0, two = 0, zero = 0;
  for (long long int i = (0); i < (n); ++i) {
    long long int hoge;
    cin >> hoge;
    if (hoge % 4 == 0) {
      four++;
      continue;
    }
    if (hoge % 2 == 0) {
      two++;
      continue;
    } else {
      zero++;
    }
  }
  if (two == 1) {
    zero++;
    if (four + 1 >= zero) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  } else {
    if (four >= zero) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
