#include <bits/stdc++.h>
using namespace std;
using ll = long long;
set<string> c;
map<ll, ll> mp;
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main() {
  int n;
  cin >> n;
  vector<ll> a(n);
  ll zero = 0, two_pro = 0, four_pro = 0;
  for (int i = 0; i < n; i++) {
    cin >> a.at(i);
    ll cnt = 0;
    while (a.at(i) % 2 == 0) {
      a.at(i) /= 2;
      cnt++;
      if (cnt == 2) break;
    }
    if (cnt == 0)
      zero++;
    else if (cnt > 1)
      four_pro++;
    else
      two_pro++;
  }
  if (zero > 2)
    four_pro -= (zero + 1);
  else if (n > 3 && zero > 0)
    four_pro -= zero;
  else if (n <= 3 && zero > 0 && four_pro != 0)
    four_pro -= (zero - 1);
  else if (n <= 3 && four_pro == 0 && zero > 0)
    four_pro = -1;
  if (four_pro < 0)
    cout << "No" << endl;
  else
    cout << "Yes" << endl;
}
