#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll n) {
  vector<pair<ll, int>> res;
  for (ll i = 2; i * i <= n; ++i) {
    if (n % i) continue;
    res.emplace_back(i, 0);
    while (n % i == 0) {
      n /= i;
      res.back().second++;
    }
  }
  if (n != 1) res.emplace_back(n, 1);
  return res;
}
int main() {
  int N;
  cin >> N;
  vector<ll> a(N);
  for (int i = 0, i_len = (N); i < i_len; ++i) cin >> a.at(i);
  ll four = 0, odd = 0, two = 0;
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    if (a.at(i) % 4 == 0)
      four++;
    else if (a.at(i) % 4 != 0 && a.at(i) % 2 == 0)
      two = 1;
    else if (a.at(i) % 2 == 1)
      odd++;
  }
  if (odd == 0)
    cout << "Yes" << endl;
  else if (four >= odd + two)
    cout << "Yes" << endl;
  else if (a.size() % 2 == 1 && four >= odd + two - 1)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
