Currency System in Geraldion

题意翻译

## 题意 Gerald居住的魔幻岛Geraldion有自己的货币体系。它使用几种价值的钞票。但问题是，这个体系并不完美，有时Geraldion人不能用任何纸币来表达一定数额的钱。当然，他们可以使用任何数量的钞票。这样的话称为不幸。Gerald想知道：最小的不幸金额是多少？ ## 输入格式## 第一行包含n（1＜=n＝1000×1）Geraldion使用的钞票的数量。 第二行包含n个不同的用空格分开的数a_1,a_2……a_n 表示钞票的价值。 ## 输出格式 输出一行。最小不幸的数。如果没有不幸的数，打印-1

题目描述

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?

输入输出格式

输入格式

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 $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=10^{6} $ ) — the values of the banknotes.

输出格式

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

输入输出样例

输入样例 #1

5
1 2 3 4 5

输出样例 #1

-1