A8849 | 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.

A single input line contains a single integer $n$ ( $1<=n<=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.