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

题意找一个可以整除2 3 5 7的n位最小数字 

当位数大于3时 因为答案的最后一位肯定是0 对答案的最后两位从小到大遍历如果可以整除就是答案

#include <bits/stdc++.h>
using namespace std;
const int mod = 210;
int num[100100];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n;
	cin >> n;
	if(n == 1 || n == 2) cout << -1;
	else if(n == 3) cout << 210;
	else{
		num[0] = 1;
		for(int i = 0;i < 10; i++){
			for(int j = 0;j < 10; j++){
				num[n-3] = i;num[n-2] = j;
				long long x = 0;
				for(int k = 0;k < n; k++){
					x = (x*10+num[k])%mod;
				}
				if(x == 0){
					for(int i = 0;i < n; i++)
						cout << num[i];
					return 0;
				}
			}
		}
	}
	return 0;
 }