#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define llong long long

void reduce_total(vector<int> &a, int n, int base, int num) {
    sort(a.begin(), a.end(), greater<int>());
    rep(i, n) {
        int ni = min(a[i] / base, num);
        a[i] -= ni * base;
        num -= ni;
        if(num == 0) break;
    }
    if(num > 0) {
        sort(a.begin(), a.end(), greater<int>());
        rep(i, min(num, n)) a[i] = 0;
    }
}

int main() {
    int n, x, y, z;
    cin >> n >> x >> y >> z;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    rep(i, n) a[i] += 1;

    reduce_total(a, n, 10000, z);
    reduce_total(a, n, 5000, y);
    reduce_total(a, n, 1000, x);
    sort(a.begin(), a.end(), greater<int>());

    if(a[0] == 0) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}