CF248B.Chilly Willy

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.

奇利·威利喜欢玩数字游戏。他目前只知道那些本身就是一位数的质数，即：2、3、5 和 7。但威利对这类数字渐渐感到厌倦，于是设计了几款与它们相关的小游戏。

奇利·威利想找出一个长度为 $n$ 的最小正整数，使其能同时被他已知的所有数字（即 2、3、5 和 7）整除。请你帮他解决这个问题。

一个数的长度，指的是其十进制表示中不含前导零的位数。

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

单行输入包含一个整数 $n$（$1 \leq n \leq 10^5$）。

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.

输出一个整数——即问题的答案（不带前导零），如果不存在满足题目条件的数，则输出 -1（不带引号）。