Codeforces Round #152 (Div. 2) / 248B Chilly Willy (数论)

B. Chilly Willy

http://codeforces.com/problemset/problem/248/B

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

1

output

-1

input

5

output

10080

可以证明：10^n mod a =an ，数列an为一循环数列，循环长度为1/a的循环节长度。

完整代码：

/*30ms,0KB*/

#include<cstdio>
const char endnum[6][4] = {"050", "080", "170", "020", "200", "110"};

int main(void)
{
	int n;
	scanf("%d", &n);
	if (n < 3)
		puts("-1");
	else if (n == 3)
		puts("210");
	else
	{
		putchar('1');
		n -= 4;
		for (int i = 0; i < n; ++i)
			putchar('0');
		puts(endnum[n % 6]);
	}
	return 0;
}