#include <bits/stdc++.h>
using namespace std;
const int INF = (long long int)(1 << 30) - 1;
const long long int INFl = (long long int)9223372036854775807;
const int MAX = 10000;
const long long int MOD = (long long int)1e9 + 7;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
int n;
int a4, a2;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    if (t % 4 == 0) {
      a4++;
    } else if (t % 2 == 0) {
      a2++;
    }
  }
  int s = a2 ? 1 : 0;
  if ((n - a2 - s) / 2 <= a4) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
