Chilly Willy loves playing with numbers. He only knows prime numbers that are digits yet. These numbers are 2, 3, 5 and 7. But Willy grew rather bored of such numbers, so he came up with a few games that were connected with them.

Chilly Willy wants to find the minimum number of length n, such that it is simultaneously divisible by all numbers Willy already knows (2, 3, 5 and 7). Help him with that.

A number's length is the number of digits in its decimal representation without leading zeros.

Input

A single input line contains a single integer n (1 ≤ n ≤ 105).

Output

Print a single integer — the answer to the problem without leading zeroes, or "-1" (without the quotes), if the number that meet the problem condition does not exist.

Examples

Input

1


Output

-1


Input

5


Output

10080
import java.io.*;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class Q248B implements Runnable {
    private void solve() throws IOException {
        //solve
        BigInteger mm = new BigInteger("210");
        BigInteger ten = new BigInteger("10");
        int n = nextInt();
        if (n == 1 || n == 2) {
            writer.println("-1");
            return;
        }
        StringBuilder bil = new StringBuilder(n + 2);
        bil.append("1");
        for (int i = 1; i < n; i++) {
            bil.append("0");
        }
        BigInteger bigInteger = new BigInteger(bil.toString());
        BigInteger last = new BigInteger("0");
        //if(true)return;
        int count = 0;
        while (true) {
            if (bigInteger.mod(mm).intValue() == 0) {
                BigInteger multiply = new BigInteger("" + count).multiply(ten);
                String s = multiply.toString();
                if (s.length() == n) {
                    writer.println(bigInteger.toString());
                } else {

                    for (int i = 0; i < n - s.length(); i++) {
                        if (i == 0 && n != s.length()) writer.print('1');
                        else writer.print('0');
                    }
                    writer.print(s);
                }
                return;
            } else {
                bigInteger = bigInteger.add(ten);
                count++;
            }
        }
    }

    public static void main(String[] args) {
        new Q248B();
    }

    public Q248B() {
        run();
    }

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;

    public void run() {
        try {
            boolean oj = System.getProperty("ONLINE_JUDGE") != null;
            reader = oj ? new BufferedReader(new InputStreamReader(System.in)) :
                    new BufferedReader(new FileReader(new File("input.txt")));
            tokenizer = null;
            writer = new PrintWriter(System.out);
            long start = System.currentTimeMillis();
            solve();
            reader.close();
            if (!oj) writer.print("\nTime: " + (System.currentTimeMillis() - start) + "\n");
            writer.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
}