#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef __int128_t i128;
int t, k, a, aj;
template<class T>
T gcd(T a, T b)
{
	return b ? gcd(b, a % b) : a;
}

int main()
{
    ull ulcm = 1;
    i128 lcm = 1;
    freopen("user_out", "r", stdin);
    if (!(cin >> k))
        cout << 50, cerr << "Too few input k.\nHacking is invalid.", exit(0);
    if (k == -1)
        cout << 50, cerr << "You could hack it.", exit(0);
    if (k < 2 || k > 10)   
        cout << 50, cerr << "Wrong value k.\nHacking is invalid.", exit(0);
    if (!(cin >> a))
        cout << 50, cerr << "Too few input a.\nHacking is invalid.", exit(0);
    if (a < 1 || a >= 100)
        cout << 50, cerr << "Wrong value a.\nHacking is invalid.", exit(0);
    for (int j = 0; j < k; j++)
    {
        if (!(cin >> aj))
            cout << 50, cerr << "Too few numbers.\nHacking is invalid.", exit(0);
        if (aj <= a || aj > 100)
            cout << 50, cerr << "Wrong value Aj.\nHacking is invalid.", exit(0);
        lcm = lcm / gcd(lcm, i128(aj)) * aj;
        ulcm = ulcm / gcd(ulcm, ull(aj)) * aj;
    }
    if (cin >> aj)
        cout << 50, cerr << "Too many numbers.\nHacking is invalid.", exit(0);
    if (lcm == ulcm)
        cout << 0, cerr << "Sheauhaw is right. Answer is " << ulcm << ".\nHacking is failed. You lost 50 scores.", exit(0);
    cout << 100;
    cerr << "Accept!\nHacking is successful! You got 100 scores.";
	return 0;
}