#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;

ll n, x, y, z, a[100008]; 

void f(ll &k, ll gaku){
	zep(i, 0, n){
		if(a[i] > 0){
			ll buf = min(k, a[i]/gaku);
			a[i] -= buf*gaku;
			k -= buf;
		}
	}
	sort(a, a+n);
	rrep(i, n-1, 0){
		if(k > 0 && a[i] >= 0){
			a[i] -= gaku;
			k--;
		}
	}
}

int main(){
	cin.tie(0); ios::sync_with_stdio(false);
	
	cin >> n >> x >> y >> z;
	zep(i, 0, n){cin >> a[i];}
	
	ll man = 10000;
	ll go = 5000;
	ll sen = 1000;

	f(z, man);
	f(y, go);
	f(x, sen);
	
	bool ans = true;
	zep(i, 0, n){
		if(a[i] >= 0){
			ans = false;
		}
	}
	print((ans)? "Yes" : "No")
	return 0;
}