In CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.

Takahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours. The time gap between two cities is defined as follows. For two cities A and B, if the local time in city B is d o'clock at the moment when the local time in city A is 0 o'clock, then the time gap between these two cities is defined to be min(d,24-d) hours. Here, we are using 24-hour notation. That is, the local time in the i-th person's city is either d o'clock or 24-d o'clock at the moment when the local time in Takahashi's city is 0 o'clock, for example.

Then, for each pair of two people chosen from the N+1 people, he wrote out the time gap between their cities. Let the smallest time gap among them be s hours.

Find the maximum possible value of s.

Constraints

* 1 \leq N \leq 50
* 0 \leq D_i \leq 12
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N
D_1 D_2 ... D_N


Output

Print the maximum possible value of s.

Examples

Input

3
7 12 8


Output

4


Input

2
11 11


Output

2


Input

1
0


Output

0
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <string>
#include <cstring>
#include <numeric>
#include <iomanip>
using namespace std;
//
const int inf=1e9+7;//0x3f
//
int main(){
	int N;
	int D[50];
	int cnt[13];
	fill(cnt,cnt+13,0);
	cin>>N;
	for(int i=0;i<N;i++){
		cin>>D[i];
		cnt[D[i]]++;
	}
	if(cnt[0]==1||cnt[12]==2){
		cout<<0<<endl;
		return 0;
	}else{
		for(int i=1;i<12;i++){
			if(cnt[i]>=3){
				cout<<0<<endl;
				return 0;
			}
		}
	}
	int ans=0;
	for(int i=0;i<(1<<11);i++){
		int diff=inf;
		vector<int> V;
		V.push_back(0);
		for(int j=0;j<11;j++){
			if(cnt[j+1]==0){
				continue;
			}else if(cnt[j+1]==1){
				if((i>>j)&1){
					V.push_back(j+1);
				}else{
					V.push_back(24-(j+1));
				}
			}else{
				V.push_back(j+1);
				V.push_back(24-(j+1));
			}
		}
		if(cnt[12]==1){
			V.push_back(12);
		}
		sort(V.begin(),V.end());
		for(int j=0;j<V.size()-1;j++){
			diff=min(diff,abs(V[j]-V[j+1]));
		}
		diff=min(diff,abs(24-V[V.size()-1]));
		ans=max(ans,diff);
	}
	cout<<ans<<endl;
	return 0;
}