CodeForces 248B - 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 ≤ 10⁵).

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.

Sample Input

Input

1

Output

-1

Input

5

Output

10080

题目意思：求一个数，能同时被2，3,5,7整除，要求是长度为n

看了别人的代码，发现这是个找规律的题目，跟着写吧。。。

#include <stdio.h>

void solve(int n){
	char a[7][3]={"05", "08", "17", "02", "20", "11"};
	if (n <= 3) {
		printf("%d\n", n == 3 ? 210 : -1);
		return ;
	}
	int tmp = (n - 4) % 6;
	printf("1");
	for (int i = 0; i < n - 4; ++ i)
		printf("0");
	printf("%s0\n", a[tmp]);
}

int main(){
	int n;
	while (~scanf("%d", &n)){
		solve(n);
	}
	return 0;
}