#include <stdio.h>
int MIN(int p, int q) { return p<q?p:q; }
int MAX(int p, int q) { return p>q?p:q; }

int a, N, tid[20], over[20], min;

void MLX(int now, int nover) {
	int p, q, r, m, n;
	for(p=0;p<N;p++) if(!over[p]) {
		for(q=p+1;q<N;q++) if(!over[q]) {
			if(nover + 2 == N) {
				min = MIN(min, now + MAX(tid[p], tid[q]));
			}
			else {
				n = p;
				for(r=0;r<N;r++) if(over[r] && (tid[r] < tid[n])) n = r;
				over[p] = over[q] = 1;
				over[n] = 0;
				MLX(now + MAX(tid[p], tid[q]) + tid[n], nover+1);
				over[n] = 1;
				over[p] = over[q] = 0;
			}
		}
	}
}

void main() {
	printf("Gruppstorlek: ");
	scanf("%d", &N);
	for(a=0;a<N;a++) {
		printf("Tid f”r person %c: ", a + 'A');
		scanf("%d", &tid[a]);
		over[a] = 0;
	}
	min = 1000000;
	MLX(0, 0);
	printf("™verg†ngen tar %d minuter\n", min);
}