/**
* @author Ashini Singha
* IIT,Jahangirnagar University
*/

#include<bits/stdc++.h>

using namespace std;

#define     ll          long long int
#define     fo(i,b,n)   for(int i=(b); i<(n) ; i++)
#define     xx          first
#define     yy          second
#define     pb          push_back
#define     sz(n)       int(n.size())
#define     pii         pair
#define     MP          make_pair

#define     PI          acos(-1.0)

#define read(x)         scanf("%d",&x)
#define read2(x,y)      scanf("%d%d",&x,&y)
#define readl(x)        scanf("%lld",&x)
#define readl2(x,y)     scanf("%lld%lld",&x,&y)
#define readd(x)        scanf("%lf",&x)
#define readd2(x,y)     scanf("%lf%lf",&x,&y)
#define pr(n)           printf("%d",n)
#define prn(n)          printf("%d\n",n)
#define prl(n)          printf("%lld",n)
#define prln(n)         printf("%lld\n",n)
#define prd(x)          printf("%lf",x)
#define prdn(x)         printf("%lf\n",x)
#define TC(n) printf("Case %d: ",n)
#define boost ios_base::sync_with_stdio(0), cin.tie(0);
/**__________________________________________________**/



int main()
{
      boost;
      int n;
      cin >> n;
      vector<int>v;
      fo(i, 0, n) {
            int x;
            cin >> x;
            v.pb(x);
      }
      vector<int>a;
      a = v;
      sort(a.begin(), a.end());
      if(a == v) cout << n + 1 << endl;
      else cout << 1 << endl;
      return 0;
}