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

#F1612. Currency System in Geraldion

  • ID: 1618
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 排序
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Currency System in Geraldion

题目描述

A. Currency System in Geraldion
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A magic island Geraldion, where Gerald lives, has its own currency system. It uses banknotes of several values. But the problem is, the system is not perfect and sometimes it happens that Geraldionians cannot express a certain sum of money with any set of banknotes. Of course, they can use any number of banknotes of each value. Such sum is called unfortunate. Gerald wondered: what is the minimum unfortunate sum?

Input

The first line contains number n (1≤n≤1000) − the number of values of the banknotes that used in Geraldion.

The second line contains n distinct space-separated numbers a1,a2,...,an (1≤ai≤106) − the values of the banknotes.

Output

Print a single line − the minimum unfortunate sum. If there are no unfortunate sums, print -1.

Examples
Input
5
1 2 3 4 5
Output
-1

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