#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int max_num(int ary[], int length) {
  int max = ary[0];
  for (int i = 1; i < length; i++)
    if (max < ary[i]) max = ary[i];
  return max;
}
int max_ord(int ary[], int length) {
  int max;
  max = max_num(ary, length);
  for (int i = 0; i < length; i++) {
    if (ary[i] == max) return i;
  }
  return -1;
}
int min_num(int ary[], int length) {
  int min = ary[0];
  for (int i = 1; i < length; i++)
    if (min > ary[i]) min = ary[i];
  return min;
}
int min_ord(int ary[], int length) {
  int min;
  min = min_num(ary, length);
  for (int i = 0; i < length; i++) {
    if (ary[i] == min) return i;
  }
  return -1;
}
void dfs(int rest, string s) {
  if (rest == 0)
    cout << s << endl;
  else
    for (char c = 'a'; c <= 'c'; c++) dfs(rest - 1, s + c);
}
int main() {
  int n, a[100000], cnt4 = 0, cnt0 = 0, cnt2 = 0;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    if (a[i] % 4 == 0)
      cnt4++;
    else if (a[i] % 2 != 0)
      cnt0++;
    else
      cnt2++;
  }
  cnt2 %= 2;
  cout << (cnt4 * 2 < cnt0 + cnt2 ? "No" : "Yes") << endl;
}
