#include <bits/stdc++.h>
using namespace std;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
T sq(T a) {
  return a * a;
}
template <typename T>
T gcd(T a, T b) {
  if (a > b) return gcd(b, a);
  return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
  if (n == 0) return 1;
  if (n == 1) return b;
  if (n % 2 == 0) {
    return mypow(b * b, n / 2);
  } else {
    return mypow(b, n - 1) * b;
  }
}
ll pcnt(ll b) { return __builtin_popcountll(b); }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll N;
  cin >> N;
  ll group_A = 0, group_B = 0, group_C = 0;
  for (ll i = (0); i < (N); i++) {
    ll a;
    cin >> a;
    if (a % 4 == 0) {
      group_C++;
      continue;
    }
    if (a % 2 == 0) {
      group_B++;
      continue;
    }
    group_A++;
  }
  if (group_B == 1) group_A++;
  if ((group_A - 1) <= group_C)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
