#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const long long mod = 998244353;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
int n;
int a[maxn];
int solve(int num) {
  int cnt = 0;
  while (num % 2 == 0) {
    cnt++;
    num /= 2;
    if (cnt >= 2) break;
  }
  return cnt;
}
int main() {
  while (~scanf("%d", &n)) {
    int ans0 = 0, ans1 = 0, ans2 = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      int xx = solve(a[i]);
      if (xx == 0)
        ans0++;
      else if (xx == 1)
        ans1++;
      else
        ans2++;
    }
    ans1 %= 2;
    if (ans1 + ans0 <= ans2 * 2 || ans0 == 0) {
      puts("Yes");
    } else
      puts("No");
  }
  return 0;
}
