#include #define rep(i,n) for (int i = 0; i < (n); ++i) #define rrep(i,n) for (int i = (n)-1; i >= 0; i--) #define rep2(i,s,n) for (int i = (s); i < (n); ++i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define pb push_back #define eb emplace_back #define vi vector #define vvi vector> #define vl vector #define vvl vector> #define vd vector #define vs vector #define vc vector #define vb vector #define vp vector

using namespace std; using ll = long long; using P = pair; using LP = pair; template istream& operator>>(istream& is,vector& v) { for(T& t:v){is>>t;} return is; } template ostream& operator<<(ostream& os,const vector& v) { for(T t:v){os< inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;} template inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;} const int inf = 1001001001; const ll linf = 1001001001001001001; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; vi a(n); cin >> a; rep(i,n) a[i]--; vi last(n,-2); bool flag = false; rep(i,n) { if(last[a[i]] == -2 || last[a[i]] == i-1) { last[a[i]] = i; } else { if(a[i] == a[0]) { if(!flag) { flag = true; last[a[i]] = i; } else { cout << -1 << endl; return 0; } } else { cout << -1 << endl; return 0; } } } if(flag) { if(a[0] == a[n-1]) cout << 1 << endl; else cout << -1 << endl; } else { cout << 0 << endl; } }