#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
using namespace std;

#define ll long long
#define mst(a) memset(a, 0, sizeof a)

const int mod = 1e9+7;
const int maxn = 1e5+50;
const int inf = 1e9;

int a[maxn];

int main()
{
  //  freopen("in", "r", stdin);
    int n;
    scanf("%d", &n);
    int cnt1 = 0, cnt4 = 0;
    for (int i = 0; i < n; ++i)
    {
        scanf("%d", &a[i]);
        if (a[i] & 1) cnt1 ++;
        if (a[i] % 4 == 0) cnt4 ++;
    }
    bool ok = true;
    if (n & 1)
    {
        if (cnt4 + 1 < cnt1) ok = false;
    }
    else if (cnt4 < cnt1) ok = false;
    if (ok) printf("Yes\n");
    else printf("No\n");
    return 0;
}