规律题——2，3，5，7的n位最小的数

最新推荐文章于 2020-12-04 00:45:25 发布

sdau_blue

最新推荐文章于 2020-12-04 00:45:25 发布

阅读量617

点赞数

本文链接：https://blog.csdn.net/xianpingping/article/details/78546357

版权

https://cn.vjudge.net/contest/199299#problem/A

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.

Example

Input

Output

-1

Input

Output

#include<iostream>
using namespace std;
int main()
{
int T,p;
int shuchu;
while(cin>>p)
{
T=p;
if(T==1||T==2)
cout<<-1<<endl;
else if(T==3)
cout<<210<<endl;
else
{
T=T-3;
T=T%6;
if(T==0)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;
else if(i==p-2)
cout<<1;
else if(i==p-1)
cout<<1;
else
cout<<0;

}
cout<<endl;
}
else if(T==1)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;

else if(i==p-1)
cout<<5;
else
cout<<0;

}
cout<<endl;
}
else if(T==2)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;

else if(i==p-1)
cout<<8;
else
cout<<0;

}
cout<<endl;
}
else if(T==3)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;
else if(i==p-2)
cout<<1;

else if(i==p-1)
cout<<7;
else
cout<<0;

}
cout<<endl;
}
else if(T==4)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;

else if(i==p-1)
cout<<2;
else
cout<<0;

}
cout<<endl;
}
else if(T==5)
{
for(int i=1;i<=p;i++)
{
if(i==1)
cout<<1;

else if(i==p-2)
cout<<2;
else
cout<<0;

}
cout<<endl;
}
}
}
return 0;
}