Problem:
Patience As the proverb says,  "Patience is bitter, but its fruit is sweet."  Writing programs within the limited time may impose 
some patience on you, but you enjoy it and win the contest, we hope. The word "patience" has the meaning of perseverance, 
but it has another meaning in card games.
Card games for one player are called "patience" in the UK
and "solitaire" in the US. Let's play a patience in this problem. In this card game, you use only twenty cards whose 
face values are positive and less than or equal to 5 (Ace's value
is 1 as usual).
Just four cards are available for each face value. At the beginning, the twenty cards are laid
in five rows by four columns (See Figure 1).
All the cards are dealt face up. An example of the initial layout is shown in Figure 2.       Figure 1: Initial layout  Figure 2: Example of the initial layout   The purpose of the game is to remove as many cards as possible
by repeatedly removing a pair of neighboring cards 
of the same face value.
Let us call such a pair a matching pair . The phrase "a pair of neighboring cards" means a pair of cards which are
adjacent to each other.
For example, in Figure 1, C 6 is adjacent to any of
the following eight cards: C 1 C 2 C 3 C 5 C 7 C 9 C 10 C 11 C 3 C 2 C 6 C 7 Every time you remove a pair, you must rearrange the remaining cards 
as compact as possible. To put it concretely, each remaining card C i must be examined in turn
in its subscript order to be shifted to the uppermost-leftmost
space. How to play:  Search a matching pair. When you find more than one pair, choose one. In Figure 3, you decided to remove the pair of C 6 and C 9 . Remove the pair. (See Figure 4) Shift the remaining cards to the uppermost-leftmost space
(See Figure 5, 6). Repeat the above procedure until you cannot remove any pair.       Figure 3: A matching pair found  Figure 4: Remove the matching pair         Figure 5: Shift the remaining cards  Figure 6: Rearranged layout   If you can remove all the twenty cards, you win the game 
and your penalty is 0.
If you leave some cards,
you lose the game and 
your penalty is the number of the remaining cards. Whenever you find multiple matching pairs,
you must choose one pair out of them 
as in the step 2 of the above procedure.
The result of the game depends on these choices. Your job is to write a program which answers the minimal penalty
for each initial layout. Input The input consists of multiple card layouts.
The input is given in the following format.  N  Layout 0  Layout 1 ... Layout N -1   N is the number of card layouts.
Each card layout gives the initial state of a game.
A card layout is given in the following format.  C 0  C 1  C 2  C 3  C 4  C 5  C 6  C 7  C 8  C 9  C 10  C 11  C 12  C 13  C 14  C 15  C 16  C 17  C 18  C 19   C i (0 <= i <= 19) is an integer 
from 1 to 5 which represents the face value of the card. Output For every initial card layout, the minimal penalty should be output,
each in a separate line. Sample Input 4
1 4 5 2
3 1 4 3
5 4 2 2
4 5 2 3
1 1 3 5
5 1 5 1
4 5 3 2
3 2 1 4
1 4 5 3
2 3 4 2
1 2 1 2
5 4 5 4
2 1 2 1
3 5 3 4
3 3 5 4
4 2 3 1
2 5 3 1
3 5 4 2
1 5 4 1
4 5 3 2 Output for the Sample Input 0
4
12
0

Solution (Python):



pair = [[1,4,5], [2,4,5,6], [3,5,6,7], [6,7], [5,8,9],
	[6,8,9,10], [7,9,10,11], [10,11], [9,12,13], [10,12,13,14],
	[11,13,14,15], [14,15], [13,16,17], [14,16,17,18], [15,17,18,19],
	[18,19], [17], [18], [19]]

def combi(cd, n):
	global ans
	ans = min(ans, n)
	if n == 0: return True
	for p in range(n-1):
		a = (cd >> (p*3)) & 7
		for q in pair[p]:
			b = (cd >> (q*3)) & 7
			if a != b: continue
			b1 =  cd             & ((1<<(p*3))-1)
			b2 = (cd >> (p+1)*3) & ((1<<(q-p-1)*3)-1)
			b3 = (cd >> (q+1)*3) & ((1<<(n-q-1)*3)-1)
			nc = b1 | (b2<<(p*3)) | (b3<<(q-1)*3)
			if combi(nc, n-2): return True
	return False

for _ in range(int(input())):
	k = []
	for i in range(5):
		k.extend(list(map(int, input().split())))
	card = 0
	for i in range(19, -1, -1): card = (card<<3)|k[i]
	ans = 20
	combi(card, 20)
	print(ans)