import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}
	// =====================================================================
	Map<Integer, Integer> map = new TreeMap();		// 差分のカウント
	List<Integer> list = new ArrayList();			// 差分が１つのリスト
	boolean[] f = new boolean[24];					// 都市の存在状態（計算用）
	public void solve() {
		int N = ni();
		int[] D = new int[N];						// 0 <= D <= 12
		for (int i = 0; i < N; i++) {
			D[i] = ni();
			map.merge(D[i], 1, Integer::sum);
		}
		int cnt;
		f[0] = true;
		for (int key : map.keySet()) {				// 0 <= key <= 12
			cnt = map.get(key);
			if(key == 0 || cnt > 2 || (key == 12 && cnt == 2)) {
				out.println(0);
				return;
			}
			if(cnt == 1)		list.add(key);		// ２つの可能性がある
			else {
				f[key] = true;
				f[24-key] = true;
			}
		}
		int ans = 0, min, wk;
		for (int i = 0; i < (int)(1 << list.size()); i++) {
			cnt = 0;
			for (int key : list) {					// 0 <= key <= 12
				if(key == 12) {
					f[key] = true;
				} else if((i & (1 << cnt)) == 0) {
					f[key] = false;
					f[24-key] = true;
				} else {
					f[key] = true;
					f[24-key] = false;
				}
				cnt++;
			}
			min = 99999;
			for (int j = 0; j < 23; j++) {				// 0 - 22
				for (int j2 = j+1; j2 < 24; j2++) {		// 1 - 23
					if(!f[j] || !f[j2])		continue;
					wk = Math.min(j2 - j, 24 - j2 + j);
					min = Math.min(min, wk);
				}
			}
			ans = Math.max(ans, min);
		}
		out.println(ans);
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);
	
	// Scanner
	private FastScanner scan = new FastScanner();
	int ni(){ return scan.nextInt();}
	int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
	int[][] ni(int y, int x){int[][] a = new int[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
	long nl(){return scan.nextLong();}
	long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
	long[][] nl(int y, int x){long[][] a = new long[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
	String ns(){return scan.next();}
	String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
	String[][] ns(int y, int x){String[][] a = new String[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
}
class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
}


Measured memory_bytes: 34740