#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long linf = 1e18 + 7;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
int n, a[N], b, c;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] % 4 == 0)
      b++;
    else if (a[i] % 2 == 0)
      c++;
  }
  n -= 2 * b + 1;
  if (c >= n && c > 1 || n < 1)
    puts("Yes");
  else
    puts("No");
}
