#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
ll a[maxn];
int main()
{
	ll n;
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++)
	scanf("%lld",&a[i]);
	ll d=0,k=0;
	for(ll i=1;i<=n;i++)
	{
		if(a[i]%4==0)
		d++;
		if(a[i]%2==0&&a[i]%4!=0)
		k++;
	}
	ll p;
	if(d!=0)
	p=n-d*2-1;
	else
	p=n;
	if(p<k||p==0||k==n)
	printf("Yes\n");
	else
	printf("No\n");
	return 0;
}#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
ll a[maxn];
int main()
{
	ll n;
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++)
	scanf("%lld",&a[i]);
	ll d=0,k=0;
	for(ll i=1;i<=n;i++)
	{
		if(a[i]%4==0)
		d++;
		if(a[i]%2==0&&a[i]%4!=0)
		k++;
	}
	ll p;
	if(d!=0)
	p=n-d*2-1;
	else
	p=n;
	if(p<k||p==0||k==n)
	printf("Yes\n");
	else
	printf("No\n");
	return 0;
}