#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using pq = priority_queue<int>;
int main() {
  int n;
  cin >> n;
  vector<long> a(n);
  for (int i = 0; i < (int)(n); i++) cin >> a[i];
  int zero = 0, one = 0, two = 0;
  for (int i = 0; i < (int)(n); i++) {
    if (a[i] % 2 == 0 && a[i] / 2 >= 2)
      two++;
    else if (a[i] == 2)
      one++;
    else
      zero++;
  }
  if (one == 0) {
    if (zero - two <= 1)
      cout << "Yes\n";
    else
      cout << "No\n";
  } else if (one > 0) {
    zero++;
    if (zero - two <= 1)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return (0);
}
