#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1 << 30;
const ll INF2 = 9e18;
const double INF3 = 9e14;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int tx[8] = {-1, 0, 1, -1, 1, -1, 0, 1},
          ty[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int main() {
  int n, a[100010], cnt[3] = {0};
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    int c = 0;
    while (true) {
      if (a[i] % 2 == 1) break;
      c++;
      a[i] /= 2;
    }
    if (c == 0)
      cnt[0]++;
    else if (c == 1)
      cnt[1]++;
    else
      cnt[2]++;
  }
  if (cnt[0] > cnt[2] * 2) {
    cout << "No" << endl;
    return 0;
  }
  cnt[2] -= cnt[0] / 2;
  cnt[1] -= cnt[2] * 2;
  if (cnt[1] > 0 && cnt[1] % 2 == 1 && cnt[2] == 0) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  return 0;
}
