import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = RD!long;
	auto a = RDR.split.to!(long[]);

	long cnt2, cnt4;
	foreach (e; a)
	{
		if (e % 4 == 0) ++cnt4;
		else if (e % 2 == 0) ++cnt2;
	}
	long cnt1 = N - cnt2 - cnt4;
	auto ans = cnt1 + cnt4 == N ? cnt4 >= cnt1 - 1 : cnt4 >= cnt1;

	writeln(ans ? "Yes" : "No");
	stdout.flush();
}