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
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;

public class Main {

    public static void main(String[] args) {
        if (args.length > 0 && args[0].toLowerCase().equals("local")) {
            try {
                System.setIn(new FileInputStream("input.txt"));
                System.setOut(new PrintStream(new File("output.txt")));
            } catch (IOException exc) {
            }
        }
        Task task = new Task();
        task.solve();
    }

    public static class Task {
        static final long MOD = (long) 1e9 + 7;
        static final PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        public void solve() {
            try {
                Scan sc = new Scan();
                int n = (int) sc.scanLong();
                int mx = n / 7;
                int fours = 0;
                int total = 0;
                boolean found = false;
                int best = Integer.MAX_VALUE;
                for (int k = 0; k <= mx; ++k) {
                    int need = n - (k * 7);
                    if (need % 4 == 0) {
                        total = k + need / 4;
                        found = true;
                        if (total < best) {
                            best = total;
                            fours = need / 4;
                        } else if (total == best) {
                            if (need / 4 < fours)
                                fours = need / 4;
                        }
                    }
                }
                if (!found) {
                    out.println(-1);
                    return;
                }
                for (int i = 0; i < fours; ++i)
                    out.print(4);
                int sevens = (n - (4 * fours)) / 7;
                while (sevens-- > 0)
                    out.print(7);

            } finally {
                out.close();
            }
        }

        private void debug(Object... x) {
            StringBuilder sb = new StringBuilder();
            for (Object o : x)
                sb.append(String.valueOf(o)).append(" ");
            out.println(sb);
        }
    }

    public static class Scan {
        private byte[] buf = new byte[1024];
        private int index;
        private InputStream in;
        private int total;

        public Scan() {
            in = System.in;
        }

        public int scan() {
            if (total < 0)
                throw new InputMismatchException();
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                if (total <= 0)
                    return -1;
            }
            return buf[index++];
        }

        public long scanLong() {
            long integer = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                } else
                    throw new InputMismatchException();
            }
            return neg * integer;
        }

        public double scanDouble() {
            double doub = 0;
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n) && n != '.') {
                if (n >= '0' && n <= '9') {
                    doub *= 10;
                    doub += n - '0';
                    n = scan();
                } else
                    throw new InputMismatchException();
            }
            if (n == '.') {
                n = scan();
                double temp = 1;
                while (!isWhiteSpace(n)) {
                    if (n >= '0' && n <= '9') {
                        temp /= 10;
                        doub += (n - '0') * temp;
                        n = scan();
                    } else
                        throw new InputMismatchException();
                }
            }
            return doub * neg;
        }

        public String scanString() {
            StringBuilder sb = new StringBuilder();
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            while (!isWhiteSpace(n)) {
                sb.append((char) n);
                n = scan();
            }
            return sb.toString();
        }

        public char scanChar() {
            int n = scan();
            while (isWhiteSpace(n))
                n = scan();
            return (char) n;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1)
                return true;
            return false;
        }
    }
}