#include <bits/stdc++.h>
using namespace std;
using pii = pair<int64_t, int64_t>;
constexpr int64_t INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int64_t mod = 1e9 + 7;
constexpr int64_t MOD = 998244353;
template <class A, class B>
inline bool chmax(A &a, const B &b) {
  return b > a && (a = b, true);
}
template <class A, class B>
inline bool chmin(A &a, const B &b) {
  return b < a && (a = b, true);
}
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T> >;
template <class T>
using max_heap = priority_queue<T>;
template <class A, class B>
using umap = unordered_map<A, B>;
int64_t gcd(int64_t a, int64_t b) { return b ? gcd(b, a % b) : a; }
int64_t lcm(int64_t a, int64_t b) { return a / gcd(a, b) * b; }
constexpr int64_t dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int64_t dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int64_t n;
  cin >> n;
  int64_t even = 0, four = 0;
  for (int64_t i = 0; i < (n); ++i) {
    int64_t a;
    cin >> a;
    if (a % 4 == 0)
      ++four;
    else if (a % 2 == 0)
      ++even;
  }
  n -= even / 2 + four;
  if (n - four <= 1)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
