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) = a₁, cnt(7) = a₂, cnt(47) = a₃, cnt(74) = a₄. Petya is not interested in the occurrences of other numbers. Help him cope with this task.

The single line contains four integers a₁, a₂, a₃ and a₄ (1 ≤ a₁, a₂, a₃, a₄ ≤ 10⁶).

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