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;
const long long int MOD1 = 1e9 + 7;
const long long int MOD2 = 998244353;
long long int mod = MOD1;
long long int po(long long int x, long long int y) {
  y %= mod;
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    y >>= 1;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(a % b, b);
}
void solve() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  if (min(a, b) < max(c, d)) {
    cout << -1;
    return;
  }
  if (abs(c - d) > 1) {
    cout << -1;
    return;
  }
  string ans;
  if (c > d) {
    for (int ii = 0; ii < c; ii++) {
      ans += "47";
      a--;
      b--;
    }
  } else if (d > c) {
    for (int ii = 0; ii < d; ii++) {
      ans += "74";
      a--;
      b--;
    }
  } else {
    if (a >= c + 1) {
      ans += "4";
      a--;
      for (int ii = 0; ii < d; ii++) {
        ans += "74";
        a--;
        b--;
      }
    } else {
      ans += "7";
      b--;
      for (int ii = 0; ii < d; ii++) {
        ans += "47";
        a--;
        b--;
      }
    }
  }
  if (a < 0 || b < 0) {
    cout << -1;
    return;
  }
  int x = -1, y = -1;
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i] == '4') {
      x = i;
      break;
    }
  }
  for (int i = ans.size() - 1; i >= 0; i--) {
    if (ans[i] == '7') {
      y = i;
      break;
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i];
    if (i == x && a > 0) {
      while (a) {
        cout << "4";
        a--;
      }
    } else if (i == y && b > 0) {
      while (b) {
        cout << "7";
        b--;
      }
    }
  }
}
int main() {
  {
    solve();
    cout << "\n";
    ;
  }
}
