input()
print(('1' in input().split())*-2+1)
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
/*int solve() {
int n, ans = -1;
cin >> n;
map<int, int>mp;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
mp[x]++;
if (mp[x] >= 3)
ans = x;
}
return ans;
}*/
int main()
{
/*int t;
cin >> t;
while (t--) {
cout << solve();
cout << endl;
}*/
int n;
cin >> n;
vector<int>vec;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back(x);
if (vec[i] == 1) {
cout << -1<<endl;
exit(0);
}
}
cout << 1<<endl;
}
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |