#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bitset>

using namespace std;
typedef long long ll;

//最小公倍数
ll gcd(ll x, ll y) {
  ll tmp = 0;
  if (x < y){
    tmp=x;
    x=y;
    y=tmp;
  }
  while (y > 0) {
    ll r = x % y;
    x = y;
    y = r;
  }
  return x;
}

//最大公倍数
ll lcm(ll x,ll y){
  return x/gcd(x,y)*y;
}


//for(int i = ; i < ; i++){}

int main(){
  int n;
  cin>>n;
  int c1=0;
  int c2=0;
  int c4=0;
  for(int i = 0; i < n; i++){
    int s;
    cin>>s;
    if(s%4==0){
      c4++;
    }
    else if(s%2==0){
      c2++;
    }
    else{
      c1++;
    }
  }
  if(b1<=b4) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}


