import sys
from bisect import bisect_left as bi_l, bisect_right as bi_r

n, x, y, z, *A = map(int, sys.stdin.read().split())

def main():
    A.sort(reverse=True)
    r = [x, y, z]
    cand = [1000, 5000, 10000]
    for a in A:
        for i in range(2, -1, -1):
            q, p = divmod(a, cand[i])
            if r[i] >= q:
                r[i] -= q
                q = 0
            else:
                q -= r[i]
                r[i] = 0
            a = q * cand[i] + p
        i = bi_r(cand, a)
        while i < 3:
            if r[i] > 0:
                r[i] -= 1
                break
            else:
                i += 1
        else:
            print('No')
            return
    print('Yes')

if __name__ == '__main__':
    main()