#include <bits/stdc++.h>
using namespace std;
int arr[200010];
long long int bfs(vector<int> a[]) {
  queue<int> v;
  v.push(1);
  int t;
  arr[1] = 0;
  int x;
  while (v.size()) {
    t = v.front();
    v.pop();
    if (arr[t] == 2) return 1;
    for (int i = 0; i < a[t].size(); i++) {
      x = a[t][i];
      if (arr[x] == -1) {
        v.push(x);
        arr[x] = arr[t] + 1;
      }
    }
  }
  return 0;
}
int main() {
  long long int n, r, t, f, s;
  t = f = s = 0;
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    cin >> r;
    if (r % 4 == 0)
      f++;
    else if (r % 2 == 0)
      t++;
    else
      s++;
  }
  if (t) s++;
  if (2 * f - 1 >= s || (f == 1 && s == 2))
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
