#include <bits/stdc++.h>
using namespace std;
vector<int> result;
bool flag = false;
const int maxn = 100010;
bool visited[maxn] = {false};
int sequence[maxn] = {0};
int n;
bool isLucky() {
  for (int i = 0; i <= result.size() - 2; i++) {
    if (((long long)result[i] * result[i + 1]) % 4 != 0) {
      return false;
    }
  }
  return true;
}
void DFS(int len) {
  if (len == n) {
    if (isLucky()) {
      flag = true;
      return;
    }
  }
  for (int i = 0; i < n; i++) {
    if (visited[i] == false) {
      visited[i] = true;
      result.push_back(sequence[i]);
      DFS(len + 1);
      result.pop_back();
      visited[i] = false;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &sequence[i]);
  }
  DFS(0);
  if (flag == false)
    printf("No");
  else
    printf("Yes");
}
