#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
 
const int MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  
  int n;
  cin >> n;
  vector<int>t(n);
  rep(i,n) cin >> t[i];
  int num = 0;
  int ans;
  int note[7]={0,2,4,5,7,9,11};
  
  rep(i,12){
    bool ok = true;
    rep(j,n){
      bool flag = false;
      rep(k,7){
        if(t[j]==(i+note[k])%12)flag = true;
      }
      if(!flag) ok = false;
    }
    if(ok){
      ans=i;
      ++num;
    }
  }
  if(num==1)cout << ans << endl;
  else cout << -1 << endl;
  return 0;
}