#include <cstdio>
#include <algorithm>
using namespace std;
int a[200005],n,cnt,cnt1;
int main()
{
	scanf("%d",&n);
	for (int i=0;i<n;++i)
	{
		scanf("%d",a+i);
		if (a[i]%4==0)
		{
			cnt++;
		}
		else if (a[i]%2==0)
		{
			cnt1++;
		}
	}
	n-=max(cnt1-1,0);
	if (cnt>=n/2)
	{
		puts("Yes");
	}
	else
	{
		puts("No");
	}
	return 0;
}