#include <bits/stdc++.h>
using namespace std;
int pointer, n;
long long int maxm, res;
long long int vis[100005];
long long int ar[100005];
long long int ans[100005];
long long int mark[100005];
long long int segTree[500005];
long long int cost[100006];
vector<int> adj[100005];
void constructTree(int node, int start, int end) {
  if (start == end) {
    segTree[node] = 0;
  } else {
    int mid = (start + end) / 2;
    constructTree(2 * node, start, mid);
    constructTree(2 * node + 1, mid + 1, end);
    segTree[node] = max(segTree[2 * node], segTree[2 * node + 1]);
  }
}
void update(int si, int second, int se, int pos, long long int val) {
  if (second > se || pos < second || pos > se) return;
  if (second == se) {
    cost[second] = val;
    long long int new_val = cost[second];
    long long int old_val = segTree[si];
    long long int diff = new_val - old_val;
    segTree[si] += diff;
    return;
  }
  int mid = (second + se) / 2;
  update(si * 2, second, mid, pos, val);
  update(si * 2 + 1, mid + 1, se, pos, val);
  segTree[si] = max(segTree[si * 2], segTree[si * 2 + 1]);
}
long long int get(int node, int start, int end, int l, int r) {
  if (r < start || end < l) {
    return 0;
  }
  if (l <= start && end <= r) {
    return segTree[node];
  }
  int mid = (start + end) / 2;
  long long int min1 = get(2 * node, start, mid, l, r);
  long long int min2 = get(2 * node + 1, mid + 1, end, l, r);
  return max(min1, min2);
}
void DFS(int s) {
  vis[s] = true;
  vector<int>::iterator it;
  vector<pair<int, long long int> >::iterator jt;
  int val = ar[s];
  ans[s] = val;
  pointer++;
  for (it = adj[s].begin(); it != adj[s].end(); ++it) {
    if (!vis[*it]) {
      mark[*it] = ar[*it] ^ ans[s];
      res = res ^ mark[*it];
      if (res > maxm) maxm = res;
      DFS(*it);
    }
  }
  pointer--;
  res = mark[s];
}
int main() {
  int m, a, b, i, j, q, v, home, k, t, n;
  long long int w;
  string str;
  cin >> n;
  b = 0;
  for (i = 0; i < n; i++) {
    cin >> q;
    if (q % 4 == 0) b++;
  }
  a = n / 2;
  if (b >= a)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
