#include <iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<stack>
using namespace std;
typedef  long long LL;
const int maxn=505;
char tmp[maxn];
int dp[maxn][maxn];
int max(int a,int b)
{
    if(a<b)
        return b;
    return a;
}
/*LL gcd(LL a,LL b)
{
    if(b==0)
        return a;
    return gcd(b,a%b);
}
LL lcm(LL a,LL b)
{
    return a/gcd(a,b)*b;
}*/

int main()
{
     int n;
     cin>>n;
     int num_4=0;
     int num_2=0;
     while(n--)
     {
         LL m;
         cin>>m;
         if(m%4==0)
            num_4++;
         else if(n%2==0)
         {
             num_2++;
         }

     }
     int sum=0;
     sum=num_4*2+1;
     sum+=num_2;
     if(sum>n)
        cout<<"Yes"<<endl;
     else
        cout<<"No"<<endl;

    return 0;
}
