A. Lucky Sum of Digits

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

11

output

47

input

10

output

-1

解题说明：此题要求用4和7组成一个数，该数字的每位之和为一个固定值n，求满足条件的最小的数。做法是统计出4和7的个数，让4排在前面即可。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include <algorithm>
#include<cstring>
#include<string>
using namespace std;

int main()
{
	int n, i, j;
	scanf("%d", &n);
	for (i = n / 7; i >= 0; i--)
	{
		if ((n - i * 7) % 4 == 0)
		{
			break;
		}
	}
	if (i == -1) 
	{
		printf("-1\n");
	}
	else
	{
		for (j = 0; j < (n - i * 7) / 4; j++)
		{
			printf("4");
		}
		for (j = 0; j < i; j++)
		{
			printf("7");
		}
		printf("\n");
	}
	return 0;
}