#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include<math.h>
#define rep(i,n) for(int i = 0;i<(int)(n);i++);
using namespace std;
using ll = long long;
const ll INF = 100100100100100;

ll two(ll a) {//何回2で割れるか　２以上は変わらないので２にする
	ll cnt = 0;
	while (true) {
		if (a % 2 == 0) {
			a /= 2;
			cnt++;
		}
		else break;
	}
	if (cnt >= 2) return 2;
	else return cnt;
}
int main() {
	ll N;
	cin >> N;
	vector<ll> a(N);
	ll count = 0;
	for (int i = 0; i < N; i++) {
		cin >> count;
		a[i] = two(cnt);
	}//{1 2 4 8}ならa ={0 1 2 2}
	vector<ll> twonum(3);//{0の数,１の数,２の数}
	for (int i = 0; i < N; i++) twonum[a[i]]++;
	if (twonum[1] == 1)twonum[0] += 1;
	if (twonum[0] <= twonum[2] * 2)cout << "Yes" << endl;
	else cout << "No" << endl;
}
