#include <bits/stdc++.h>
const int MOD = 1E9 + 7;
const int N = 200000 + 5;
const int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
using namespace std;
int main() {
  long long n, modFour = 0, modTwo = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    if (a % 4)
      modFour++;
    else if (a % 2)
      modTwo++;
  }
  long long count = modFour + (modTwo / 2);
  if (count >= n / 2)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
