#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
ll inf = 1e10;
ll gcd(ll a, ll b) { return (b != 0) ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<ll> a(n);
  for (int i = 0; i < (int)n; i++) cin >> a[i];
  int cnt = 0;
  auto f = [](ll x) {
    int cnt = 0;
    while (x % 2 == 0 && x >= 1) {
      x /= 2;
      ++cnt;
    }
    return cnt;
  };
  for (int i = 0; i < (int)n; i++) {
    cnt += f(a[i]);
  }
  if (n % 2 == 0 && cnt >= n)
    cout << "Yes"
         << "\n";
  else if (n % 2 == 1 && cnt >= n - 1)
    cout << "Yes"
         << "\n";
  else
    cout << "No"
         << "\n";
}
