#include <bits/stdc++.h>
using std::sort;
using std::swap;
using std::vector;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-8;
int main() {
  int N;
  scanf("%d", &N);
  int *sample = new int[N];
  for (int i = 0; i < N; ++i) {
    scanf("%d", sample + i);
  }
  sort(sample, sample + N);
  int flag = 0;
  for (int i = 0; i < N - 1; ++i) {
    int temp = i + 1;
    int j;
    for (j = temp; j < N; ++j) {
      if (sample[j] * sample[i] % 4 == 0) {
        if (j == temp)
          break;
        else {
          swap(sample[temp], sample[j]);
          sort(sample + temp + 1, sample + N);
          break;
        }
      }
    }
    if (j == N) {
      flag = 1;
      printf("No\n");
      break;
    }
  }
  if (flag == 0) {
    printf("Yes\n");
  }
  return 0;
}
