跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2622. Chilly Willy

  • ID: 2628
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 数学
  • 数论
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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≤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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2279 题。保留原作者与原赛事署名。