Preparando MOJI

Lucky Sum of Digits

2000ms 262144K

Description:

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.

Sample Input:

11

Sample Output:

47

Sample Input:

10

Sample Output:

-1

Informação

Codeforces

Provedor Codeforces

Código CF109A

Tags

brute forceimplementation

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:32:32

Relacionados

Nada ainda