human
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
The above is tricky. Write me a correct solution in PYTHON3.

=====
Write me a Python code 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)?
assistant
#Here is Python code 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).

class CodeforcesTask248BSolution:
    def __init__(self):
        self.result = ''
        self.n = 0

    def read_input(self):
        self.n = int(input())

    def process_task(self):
        if self.n < 3:
            self.result = "-1"
        else:
            res = ((10 ** (self.n - 1)) // 210) * 210 + (210 if 10 ** (self.n - 1) % 210 else 0)
            self.result = str(res)

    def get_result(self):
        return self.result

if __name__ == "__main__":
    Solution = CodeforcesTask248BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())