Codeforces Round #152 (Div. 2，B. Chilly Willy)（python大数练习）

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

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

思路：

        相邻的210个数中一定有210的倍数，所以大数暴力即可，python求幂运算较慢，

直接用快速幂。

代码实现：

#m, n = map(int, input().split())
#a,b=map(int,input().split())
def mypow(a,b):
	base=a 
	res=1
	while b:
		if b&1:
			res*=base
		base*=base
		b>>=1
	return res
def sol(n):
	sum=mypow(10,n-1)
	for i in range(sum,sum + 210+1,1):
		if i%210==0:
			return i
n=int(input())
if n<3:
	print(-1)
else:
	print(sol(n))

THE END;