#include <bits/stdc++.h>
using namespace std;
bool prime[1000001];
void debug(long long int a) { cout << a << endl; }
long long int sieve(long long int a) {
  memset(prime, true, sizeof(prime));
  long long int p, i;
  for (p = 2; p * p <= a; p++) {
    if (prime[p] == true) {
      for (i = p * 2; i <= a; i += p) prime[i] = false;
    }
  }
  return 0;
}
long long int powermod(long long int _a, long long int _b, long long int _m) {
  long long int _r = 1;
  while (_b) {
    if (_b % 2 == 1) _r = (_r * _a) % _m;
    _b /= 2;
    _a = (_a * _a) % _m;
  }
  return _r;
}
long long int find_max(long long int __a, long long int __b) {
  return __a ^ ((__a ^ __b) & -(__a < __b));
}
long long int add(long long int __a, long long int __b, long long int MOD) {
  long long int x = (__a + __b) % MOD;
  return x;
}
long long int mul(long long int a, long long int b, long long int MOD) {
  long long int x = (a * b) % MOD;
  return x;
}
long long int sub(long long int a, long long int b, long long int MOD) {
  long long int x = (a - b + MOD) % MOD;
  return x;
}
long long int div(long long int a, long long int b, long long int MOD) {
  long long int x = a;
  long long int y = powermod(b, MOD - 2, MOD);
  long long int res = (x * y) % MOD;
  return res;
}
vector<int> answer, answer1, answer2;
int solve(int a) {
  int a1 = a;
  int ans = 0;
  while (a > 0) {
    if (a % 2 == 0)
      ans++;
    else
      break;
    a /= 2;
  }
  if (ans == 0)
    answer.push_back(a1);
  else if (ans == 1)
    answer1.push_back(a1);
  else
    answer2.push_back(a1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(20);
  long long int t, i, j;
  t = 1;
  long long int counter1 = 0;
  while (t--) {
    counter1++;
    int n;
    cin >> n;
    int x;
    for (i = 0; i < n; i++) {
      cin >> x;
      solve(x);
    }
    if (answer1.size() == 0 && answer2.size() == 0) {
      cout << "No" << endl;
      return 0;
    }
    if (answer2.size() == 0 && answer.size() == 0 && answer1.size() == 1) {
      cout << "No" << endl;
      return 0;
    }
    if (answer2.size() == 0 && answer1.size() != 0 && answer.size() != 0) {
      cout << "No" << endl;
      return 0;
    }
    if (answer.size() == 0) {
      cout << "Yes" << endl;
      return 0;
    }
    if (answer.size() - 1 > answer2.size()) {
      cout << "No" << endl;
      return 0;
    } else {
      cout << "Yes" << endl;
      return 0;
    }
  }
}
