#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(),a.end())
using namespace std;
int main(){
    //Seiranchan!
    int N,F=0,G=0,K=0;
    cin >> N;
    vector<int> vec(N);
    REP(i,N) cin >> vec[i];

    REP(i,N){
        if(vec[i]%4==0){
            F++;
        }else if(vec[i]%2==0){
            G++;
        }else{
            K++;
        }
    }

    if(F*3>=N){
        cout << "Yes" <<endl;
    }else if(F>=K){
        cout << "Yes"  <<endl;
    }else if(F*3>=(N-G){
        cout << "Yes"<<endl;
        }else{
        cout << "No" <<endl;
    }

}


