Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Petya wonders eagerly what minimum lucky number has the sum of digits equal to n. Help him cope with the task.

Input

The single line contains an integer n (1 ≤ n ≤ 106) — the sum of digits of the required lucky number.

Output

Print on the single line the result — the minimum lucky number, whose sum of digits equals n. If such number does not exist, print -1.

Examples

Input

11


Output

47


Input

10


Output

-1
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int test, n, i, j, k, x, y, t, a, b;
  cin >> n;
  x = n / 7;
  for (i = x; i >= 0; i--) {
    k = i * 7;
    k = n - k;
    a = k / 4;
    b = i;
    if (k % 4 == 0) break;
  }
  if (((a * 4) + (b * 7)) == n) {
    for (i = 0; i < a; i++) cout << 4;
    for (i = 0; i < b; i++) cout << 7;
  } else
    cout << -1;
}
