#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vector<int> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
pair<ll, ll> readh(bool g = 0) {
  pair<ll, ll> u;
  int k = scanf("%d %d", &u.first, &u.second);
  if (g) u.first--, u.second--;
  return u;
}
void printh(pair<ll, ll> t) { printf("%lld %lld\n", t.first, t.second); }
bool inarea(pair<ll, ll> t, int h, int w) {
  return 0 <= t.first && t.first < h && 0 <= t.second && t.second < w;
}
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
  ll res = 1;
  x %= p;
  while (n > 0) {
    if (n & 1) res = res * x % p;
    x = x * x % p;
    n >>= 1;
  }
  return res;
}
ll bitcount(ll x) {
  int sum = 0;
  for (int i = 0; i < 60; i++)
    if ((1ll << i) & x) sum++;
  return sum;
}
signed main() {
  int n = read();
  vector<ll> a;
  int b = 0, c = 0;
  for (int(i) = 0; (i) < (n); (i)++) {
    a.emplace_back(read());
    if (a[i] & 1)
      b++;
    else if (~(a[i] >> 1) & 1)
      c++;
  }
  if (b > c + 1)
    printf("No\n");
  else if (b == c + 1 && (n - b - c) == 1)
    printf("No\n");
  else
    printf("Yes\n");
}
