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

import java.util.Scanner;

public class P146D {

    public static void main(String[] args) {
        Scanner inScanner = new Scanner(System.in);
        int c4 = inScanner.nextInt();
        int c7 = inScanner.nextInt();
        int c47 = inScanner.nextInt();
        int c74 = inScanner.nextInt();
        StringBuilder s = new StringBuilder();
        /*
        if (c4 < c47 + c74 || c7 < c47 + c74) {
            System.out.println(-1);
            return;
        }
        */
        if (c74 == 0) {
            if (c47 == 0) {
                if (c7 == 0 || c4 == 0) {
                    for (int i = 0; i < c4; i++) {
                        s.append(4);
                    }
                    for (int i = 0; i < c7; i++) {
                        s.append(7);
                    }
                    System.out.println(s);
                    return;
                }
                else {
                    System.out.println(-1);
                    return;
                }
            }
            else if (c47 == 1) {
                if (c4 == 0 || c7 == 0) {
                    System.out.println(-1);
                    return;
                }
                for (int i = 0; i < c4; i++) {
                    s.append(4);
                }
                for (int i = 0; i < c7; i++) {
                    s.append(7);
                }
                System.out.println(s);
                return;
            }
            else {
                System.out.println(-1);
                return;
            }
        }
        if (c47 == 0) {
            if (c74 == 1) {
                if (c4 == 0 || c7 == 0) {
                    System.out.println(-1);
                    return;
                }
                for (int i = 0; i < c7; i++) {
                    s.append(7);
                }
                for (int i = 0; i < c4; i++) {
                    s.append(4);
                }
                System.out.println(s);
                return;
            }
            else {
                System.out.println(-1);
                return;
            }
        }
        if (Math.abs(c74 - c47) > 1) {
            System.out.println(-1);
            return;
        }
        if (c74 == c47) {
            if (c4 < c74 || c7 < c74) {
                System.out.println(-1);
                return;
            }
            if (c4 == c47) {
                if (c7 == c47) {
                    System.out.println(-1);
                    return;
                }
                else {
                    for (int i = 0; i < c74; i++)
                        s.append(74);
                    for (int i = 0; i < c7 - c74; i++) {
                        s.append(7);
                    }
                    System.out.println(s);
                    return;
                }
            }
            else {
                for (int i = 0; i < c4 - c47 - 1; i++) {
                    s.append(4);
                }
                for (int i = 0; i < c47; i++)
                    s.append(47);
                for (int i = 0; i < c7 - c47; i++) {
                    s.append(7);
                }
                s.append(4);
                System.out.print(s);
                return;
            }
        }
        else if (c74 == c47 + 1) {
            if (c4 < c74 || c7 < c74) {
                System.out.println(-1);
                return;
            }
            s.append(74);
            for (int i = 0; i < c4 - c74; i++) {
                s.append(4);
            }
            for (int i = 0; i < c74 - 2; i++) {
                s.append(74);
            }
            for (int i = 0; i < c7 - c74 + 1; i++) {
                s.append(7);
            }
            s.append(4);
            System.out.println(s);
            return;
        }
        else {
            if (c4 < c47 || c7 < c47) {
                System.out.println(-1);
                return;
            }
            for (int i = 0; i < c4 - c47; i++) {
                s.append(4);
            }
            for (int i = 0; i < c47; i++) {
                s.append(47);
            }
            for (int i = 0; i < c7 - c47; i++) {
                s.append(7);
            }
            System.out.println(s);
            return;
        }
    }
}
