#include <bits/stdc++.h>
using namespace std;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
int lst[Max];
int ls[Max];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &lst[i]);
    if (lst[i] % 4 == 0)
      ls[4]++;
    else if (lst[i] % 2 == 0)
      ls[2]++;
    else
      ls[1]++;
  }
  long long sum = ls[4] * 2 + ls[2];
  if (ls[2] == 1) sum--;
  if (sum >= n - 1)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
