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 <bits/stdc++.h>
using namespace std;

typedef class UnionFound {
	public:
		int n;
		int *f;
		int *w;

		void init(int n) {
			this->n = n;
			f = new int[(n + 1)];
			w = new int[(n + 1)];
			for (int i = 0; i <= n; i++) {
				f[i] = i;
			}
			fill(w, w + n + 1, 0);
		}
		
		int find(int x) {
			if (f[x] == x)
				return x;
			int y = f[x];
			f[x] = find(f[x]);
			w[x] ^= w[y];
			return f[x];
		}

		bool unit(int x, int y, int t) {
			int fx = find(x), fy = find(y);
			if (fx == fy) {
				return !(w[x] ^ w[y] ^ t);
			}
			w[fx] = w[x] ^ t;
			f[fx] = y;
			return true;
		}
} UnionFound;

int n;
int a[55];

int gap(int x, int y) {
	if (x > y)
		swap(x, y);
	return min(y - x, 24 - y + x);
}

bool check(int mid) {
	UnionFound uf;
	uf.init(n);
	for (int i = 0; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (gap(a[i], a[j]) < mid) {
				if (gap(a[i], 24 - a[j]) < mid) {
					return false;
				}
				if (!uf.unit(i, j, 1)) {
					return false;
				}
			} else if (gap(a[i], 24 - a[j]) < mid) {
				if (!uf.unit(i, j, 0)) {
					return false;
				}
			}
		}
	}
	return true;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", a + i);
		if (a[i] >= 12) {
			a[i] = 24 - a[i];
		}
	}
	int ans = 0;
	while (check(ans + 1)) {
		ans++;
	}
	printf("%d\n", ans);
	return 0;
}
