#include <bits/stdc++.h>
const int len = 1e5 + 5;
int a[len], N;
bool visit[len];
bool dfs(int x, int last) {
  if (x == N) {
    return true;
  }
  for (int i = 0; i < N; ++i) {
    if (!visit[i] && (long long)a[i] * last % 4 == 0) {
      visit[i] = 1;
      if (dfs(x + 1, a[i])) return true;
      visit[i] = 0;
    }
  }
  return false;
}
int main(void) {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%d", &a[i]);
  }
  if (dfs(0, 0))
    printf("Yes");
  else
    printf("No");
  return 0;
}
