#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (long long(i) = 0; (i) < (n); (i)++) cin >> a[i];
  int count = 0;
  int two = 0;
  for (long long(i) = 0; (i) < (n); (i)++) {
    if (a[i] % 4 == 0)
      count++;
    else if (a[i] % 2 == 0)
      two++;
  }
  two = max(0, two - 1);
  if (count >= (n - count - 1 - two) && count > 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
