CodeForces 248B - Chilly Willy - 找规律

B. Chilly Willy

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.

Examples

Input

1

Output

-1

Input

5

Output

10080

#include<cstdio>
#include<cstdlib>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    if(n<3)
        printf("-1\n");//此时没有答案
    else if(n==3)
        printf("210\n");//容易算出210
        else//后面的数根据规律来算
        {
            printf("1");
            int m=50;
            for(int i=0;i<n-4;i++)
            {
                m=m*10%210;
                printf("0");
            }
            printf("%03d\n",m);//不足三位前面补0
        }
    return 0;
}