#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T, class U>
using P = pair<T, U>;
template <class T>
using Heap = priority_queue<T>;
template <class T>
using heaP = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U>
using umap = unordered_map<T, U>;
template <class T>
using uset = unordered_set<T>;
template <class T>
bool ChangeMax(T& a, const T& b) {
  if (a >= b) return false;
  a = b;
  return true;
}
template <class T>
bool ChangeMin(T& a, const T& b) {
  if (a <= b) return false;
  a = b;
  return true;
}
template <class T, size_t N, class U>
void Fill(T (&a)[N], const U& v) {
  fill((U*)a, (U*)(a + N), v);
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& e : v) is >> e;
  return is;
}
int main() {
  int n;
  cin >> n;
  int a = 0, b = 0, c = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    if (x % 2 == 1)
      c++;
    else if (x % 4 == 0)
      a++;
    else
      b++;
  }
  int pre = 2;
  bool f = true;
  while (a > 0 || b > 0 || c > 0) {
    if (pre == 2) {
      if (c > 0) {
        c--;
        pre = 0;
      } else
        break;
    } else if (pre == 1) {
      if (b > 0) {
        b--;
        pre = 1;
      } else if (a > 0) {
        a--;
        pre = 2;
      } else {
        f = false;
        break;
      }
    } else {
      if (a > 0) {
        a--;
        pre = 4;
      } else {
        f = false;
        break;
      }
    }
  }
  cout << (f ? "Yes" : "No") << endl;
}
