#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<pair<long long, long long>> prime_foctorize(long long N) {
  vector<pair<long long, long long>> res;
  for (long long i = 2; i * i <= N; i++) {
    if (N % i != 0) continue;
    long long ex = 0;
    while (N % i == 0) {
      ex++;
      N /= i;
    }
    res.push_back({i, ex});
  }
  if (N != 1) res.push_back({N, 1});
  return res;
}
int main() {
  long long N;
  cin >> N;
  vector<long long> A(N);
  long long cnt = 0;
  for (int i = 0; i < N; i++) {
    cin >> A.at(i);
    const auto &pf = prime_foctorize(A.at(i));
    for (auto p : pf)
      if (p.first == 2) {
        cnt += p.second;
        break;
      }
  }
  if (cnt >= N / 2)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
