有1输出-1
没1输出1 .....
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <vector>
using namespace std;
const int maxn = 2147483647;
int a[1006];
int main()
{
int n,i;
scanf("%d",&n);
int minn=maxn;
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if (minn>a[i])
minn=a[i];
}
if (minn==1)
printf("-1\n");
else
{
printf("%d\n",1);
}
return 0;
}