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.io.*;
import java.util.*;


public class Main {
   public static void main(String[] args) throws FileNotFoundException
   {
	   (new Main()).solve();
   }
   public void Main() {
   }
   
   void solve()  throws FileNotFoundException {
      Scanner in = new Scanner(System.in);
	  PrintWriter out = new PrintWriter(System.out);
     // Scanner in = new Scanner(new FileReader("input.txt"));
	 // PrintWriter out = new PrintWriter("output.txt");
     int n4, n7, n47, n74;
     
     n4 = in.nextInt();
     n7 = in.nextInt();
     n47 = in.nextInt();
     n74 = in.nextInt();
     
     if ((n47 > n74 + 1) || (n74 > n47 + 1)) {
    	 out.print(-1);
     } else {
    	 if (n47 == n74 + 1) {
    		 n4 -= n47;
    		 n7 -= n47;
    		 if (n4 < 0 || n7 < 0) {
    			 out.print(-1);
    		 } else {
    			 for (int i = 0; i < n4; i++) {
    				 out.print("4");
    			 } 
    			 for (int i = 0; i < n47; i++) {
    				 out.print("47");
    			 }
    			 for (int i = 0 ; i < n7; i++) {
    				 out.print("7");
    			 }
    		 }
    	 } else if (n74 == n47 + 1) {
    		 n4 -= n74;
    		 n7 -= n74;
    		 if (n4 < 0 || n7 < 0) {
    			 out.print(-1);
    		 } else {
    			 if (n74 == 0) {
	    			 for (int i = 0 ; i < n7; i++) {
	    				 out.print("7");
	    			 }
    			 }
    			 if (n74 > 0) {
    				 out.print("74");
    				 n74--;
    			 }
    			 for (int i = 0; i < n4; i++) {
    				 out.print("4");
    			 } 
    			 for (int i = 0; i < n74 - 1; i++) {
    				 out.print("74");
    			 }
    			 if (n74 > 0) {
    				 out.print("7");
	    			 for (int i = 0 ; i < n7; i++) {
	    				 out.print("7");
	    			 }
    				 out.print("4");
    			 }
    		 }
    	 } else {
    		 if (n47 > n4 || n47 > n7) {
    			 out.print(-1);
    		 } else {
    			 if (n47 == n4) {
    				 n7 -= n4;
    				 if (n7 < 1) {
    					 out.print(-1);
    				 } else {
	    				 for (int i = 0; i < n4; i++) {
	    					 out.print("74");
	    				 }
	    				 for (int i = 0; i < n7; i++) {
	    					 out.print("7");
	    				 }
    				 }
    			 } else {
    				 n4 -= n47;
    				 n7 -= n47;
    				 if (n4 < 1) {
    					 out.print(-1);
    				 } else {
    					 for (int i = 0; i < n4 - 1; i++) {
    						 out.print("4");
    					 }
    					 for (int i = 0; i < n47; i++) {
    						 out.print("47");
    					 }
    					 for (int i = 0; i < n7; i++) {
    						 out.print("7");
    					 }
    					 out.print("4");
    				 }
    			 }
    		 }
    	 }
     }
     
     out.close();
   }

};

