#include <bits/stdc++.h>
using namespace std;
int fun(int arr[], int n) {
  do {
    int flag = 1;
    int i;
    for (i = 0; i < n - 1 && flag == 1; i++) {
      if ((arr[i] + arr[i + 1]) < 2) {
        flag = 0;
      }
    }
    if (flag == 1) {
      return 1;
    }
  } while (next_permutation(arr, arr + n));
  return 0;
}
int main() {
  int n, i;
  int arr[100000];
  scanf("%d", &n);
  long long temp;
  for (i = 0; i < n; i++) {
    scanf("%lld", &temp);
    arr[i] = 0;
    if (temp % 4 == 0) {
      arr[i] = 2;
    } else if (temp % 2 == 0) {
      arr[i] = 1;
    } else {
      arr[i] = 0;
    }
  }
  sort(arr, arr + n);
  if (fun(arr, n) == 1) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}
