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
#include <bits/stdc++.h>
using namespace std;
bool good(const string &S, int a1, int a2, int a3, int a4) {
  int s1 = 0, s2 = 0, s3 = 0, s4 = 0;
  for (char c : S) (c == '4' ? s1 : s2)++;
  for (int i = 0; i < int(S.length()) - 1; ++i) {
    if (S[i] == '4' && S[i + 1] == '7')
      ++s3;
    else if (S[i] == '7' && S[i + 1] == '4')
      ++s4;
  }
  return s1 == a1 && s2 == a2 && s3 == a3 && s4 == a4;
}
int main() {
  ios::sync_with_stdio(false);
  int a1, a2, a3, a4;
  cin >> a1 >> a2 >> a3 >> a4;
  string S;
  if (a3 != a4) {
    if (a3 > a4) {
      for (int i = 0; i < a1 - a4; ++i) S += '4';
      for (int i = 0; i < a4; ++i) S += "74";
      for (int i = 0; i < a2 - a4; ++i) S += '7';
    } else {
      S += '7';
      for (int i = 0; i < a1 - a4 + 1; ++i) S += '4';
      for (int i = 0; i < a4 - 2; ++i) S += "74";
      for (int i = 0; i < a2 - a4 + 1; ++i) S += '7';
      S += '4';
      cerr << S;
    }
  } else {
    string S1, S2;
    for (int i = 0; i < a1 - a3; ++i) S1 += '4';
    for (int i = 0; i < a3 - 1; ++i) S1 += "74";
    for (int i = 0; i < a2 - a3 + 1; ++i) S1 += '7';
    S1 += '4';
    S2 += '7';
    for (int i = 0; i < a1 - a3; ++i) S2 += '4';
    for (int i = 0; i < a3; ++i) S2 += "47";
    for (int i = 0; i < a2 - a3 - 1; ++i) S2 += '7';
    if (good(S1, a1, a2, a3, a4))
      S = S1;
    else
      S = S2;
  }
  if (good(S, a1, a2, a3, a4))
    cout << S << '\n';
  else
    cout << "-1\n";
}
