#include<bits/stdc++.h>
using namespace std;
short n;
int ans;
struct str{
    long long n;
    int p;
};
str m[1050000];
bool cmp1(str a,str b){ return a.n<b.n; }
bool cmp2(str a,str b){
    if(!b.n) return a.n>b.n;
    else return a.n<b.n;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    freopen("subsets.in","r",stdin);
    freopen("subsets.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>m[i].n;
    }
    
    if(n==2){
        if(m[0].n==m[1].n) cout<<1;
        else cout<<0;
        return 0;
    }
    else cout<<25535;//////////// 
    sort(m,m+n,cmp1);
    
    //开摆！！ 
    
    return 0;
}