#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

constexpr int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
constexpr int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template <class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template <class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }

#include "bits/stdc++.h"


struct RMQ {
	using t = long long;
	constexpr static t id() {
		return std::numeric_limits<t>::min();
	}
	static t op(const t &a, const t &b) {
		return std::max(a, b);
	}
};

struct RmQ {
	using t = long long;
	constexpr static t id() {
		return std::numeric_limits<t>::max();
	}
	static t op(const t &a, const t &b) {
		return std::min(a, b);
	}
};

template <typename M>
struct SegmentTree {
	int n;
	using T = typename M::t;
	std::vector<T> nodes;

	SegmentTree(std::vector<T> v) {
		int sz = (int)v.size();
		n = 1; while (n < sz) n *= 2;
		nodes.resize(2 * n - 1, M::id());
		for (int i = 0; i < sz; i++) nodes[i + n - 1] = v[i];
		for (int i = n - 2; i >= 0; i--) nodes[i] = M::op(nodes[i * 2 + 1], nodes[i * 2 + 2]);
	}
	SegmentTree(int _n) {
		n = 1;
		while (n < _n)n *= 2;
		nodes.resize(2 * n - 1, M::id());
	}
	void update(int k, T a) {
		k += n - 1;
		nodes[k] = a;
		while (k > 0) {
			k = (k - 1) / 2;
			nodes[k] = M::op(nodes[2 * k + 1], nodes[2 * k + 2]);
		}
	}
	T query(int a, int b) {
		return query(a, b, 0, 0, n);
	}
private:
	T query(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l)return M::id();
		if (a <= l && r <= b)return nodes[k];
		else {
			T vl = query(a, b, 2 * k + 1, l, (r + l) / 2),
				vr = query(a, b, 2 * k + 2, (r + l) / 2, r);
			return M::op(vl, vr);
		}
	}
};

pll dfs(vl &v, vector<vector<pll>> &dp, int i, int j) {
	if (i >= j)return pll(0, 0);
	if (dp[i][j].first != -1)return dp[i][j];
	pll ret = { INF*INF,INF*INF };
	FOR(k, i + 1, j) {
		pll a = dfs(v, dp, i, k), b = dfs(v, dp, k, j);
		chmin(ret, { a.first + b.first + a.second + b.second,a.second + b.second });
	}
	return dp[i][j] = ret;
}
struct A {
	using t = pll;
	constexpr static t id() {
		return pll(0, 0);
	}
	static t op(const t &a, const t &b) {
		return pll(a.first + a.second + b.first + b.second, a.second + b.second);
	}
};
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	/*
	int n;
	cin >> n;
	vl v(n);
	REP(i, n)cin >> v[i];
	vector<pll> tmp(n);
	REP(i, n)tmp[i] = { 0,v[i] };
	SegmentTree<A> st(v);
	*/
	int n; cin >> n;
	vi v(n);
	REP(i, n)cin >> v[i];
	int cnt4 = 0, cnt2 = 0, cnt1 = 0;
	REP(i, n) {
		if (v[i] % 4 == 0)cnt4++;
		else if (v[i] % 2 == 0)cnt2++;
		else cnt1++;
	}
	if (cnt2 == 0) {
		if (cnt4 >= cnt1 - 1)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	else {
		if (cnt4 >= cnt1)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}

Measured memory_bytes: 640