Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Petya loves long lucky numbers very much. He is interested in the minimum lucky number d that meets some condition. Let cnt(x) be the number of occurrences of number x in number d as a substring. For example, if d = 747747, then cnt(4) = 2, cnt(7) = 4, cnt(47) = 2, cnt(74) = 2. Petya wants the following condition to fulfil simultaneously: cnt(4) = a1, cnt(7) = a2, cnt(47) = a3, cnt(74) = a4. Petya is not interested in the occurrences of other numbers. Help him cope with this task.

Input

The single line contains four integers a1, a2, a3 and a4 (1 ≤ a1, a2, a3, a4 ≤ 106).

Output

On the single line print without leading zeroes the answer to the problem — the minimum lucky number d such, that cnt(4) = a1, cnt(7) = a2, cnt(47) = a3, cnt(74) = a4. If such number does not exist, print the single number "-1" (without the quotes).

Examples

Input

2 2 1 1


Output

4774


Input

4 7 3 1


Output

-1
'''
Created on Jan 24, 2012

@author: Moatasem
'''
[a,b,c,d]= map(int,raw_input().split())
c7=0
c4=0
r=""
if(abs(c-d)>1 or c>b or c>a or d>a or d>b or a==b==c==d):
        print -1
else:
    if(c>d):
        c4+=c
        c7+=c
        r="4"*(a-c4)+"47"*c +"7"*(b-c7)
        print r
    elif(c<d):
        c4+=d
        c7+=d
        r="7"+"4"* (a-c4)+"4"+"74"*(d-2)+"7"+ "7"*(b-c7)+"4"
        print r
    else:
        c4+=c
        c7+=c
        if (a==c):
            r="74"*c +"7"*(b-c7) 
        else:       
            r="4"*(a-c4-1)+"47"*c +"7"*(b-c7)+"4"
        print r