#include using namespace std; using ll = long long; using ld = long double; using vl = vector; template using vc = vector; template using vvc = vector>; #define eb emplace_back #define all(x) (x).begin(), (x).end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define repr(i, n) for (ll i = (n)-1; i >= 0; i--) #define repe(i, l, r) for (ll i = (l); i < (r); i++) #define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--) #define repa(i,n) for (auto& i: n) template inline bool chmax(T &a, const T &b) { if (a inline bool chmin(T &a, const T &b) { if (b void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; } ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; } template void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward(t)...); } #endif const ll INF = 4e18; const ld EPS = 1e-11; const ld PI = acos(-1.0L); const ll MOD = 1e9 + 7; // const ll MOD = 998244353; //--------------------------------------------------------------------------------// int main() { init(); ll N; cin >> N; vl T(N); rep(i, N) cin >> T[i]; ll ans = 0, cnt = 0; rep(i, 12){ vl A = {i, i + 2, i + 4, i + 5, i + 7, i + 9, i + 11}; rep(j, 7) A[j] %= 12; bool isok = true; rep(j, N){ if (find(all(A), T[j]) == A.end()) isok = false; } if (isok) ans = i, cnt++; } cout << (cnt == 1 ? ans : -1) << endl; }