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
inf = 1000000000

def solve():
    n = int(input())

    num4 = inf
    num7 = inf

    for num_4 in range(n // 4 + 1):
        left = n - 4 * num_4
        if left % 7 != 0:
            continue

        num_7 = left // 7

        if num_4 + num_7 <= num4 + num7:
            num4 = num_4
            num7 = num_7

    if num4 == inf:
        print(-1)
    else:
        if num4 == 0:
            print('7'*num7)
        elif num7 == 0:
            print('4'*num4)
        else:
            print('4'*num4 + '7'*num7)


if __name__ == "__main__":
    solve()
