Codeforces Round #313 A Currency System in Geraldion，

              A  Currency System in Geraldion

Description

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 minimumunfortunate 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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶) — the values of the banknotes.

Output

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

Sample Input

5
1 2 3 4 5

-1

一開始看到就懵了，後來弄懂的時候感覺自己有點傻逼了

題意：求n個整數不能組成的最小整數，如果都存在，輸出-1.

思路：如果n個數中有1，則都能組成，輸出-1，否則不能組成的最小整數1，輸出1.

#include<iostream>
using namespace std;
int main()
{
    int t,a,ans=0;
     cin>>t;
 for(int i=1;i<=t;i++)
 {
     cin>>a;
     if(a==1)
     ans=1;
 }
 if(ans)
         cout<<"-1"<<endl;
else 
         cout<<"1"<<endl;
return 0;
}