#include<iostream>
#include<climits>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include <string>
#include <complex>
#include <functional>
using namespace std;
//typedef pair<string,string> P;
//double dat[100][100];
//int dp[6][1010];//動的計画法
//int prime[10000001];
//char str[1010][1010];
//vector<pair<int,int> > pc[100001];
//int ABS(int a){return max(a,-a);}
//long long num[100000];
int main(){
	int n,g=0,k=0,t=0;
	cin>>n;
	long long a[n];
	for(int i=0;i<n;i++) a[i]=0;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i]%4==0) g++;
		else{
			k++;
			if(a[i]%2==0) t++;
		} 
	}
	k=k-t+1
	if(g>=k-1) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}