Time Limit: Java: 10000 ms / Others: 10000 ms

Memory Limit: Java: 32768 KB / Others: 32768 KB

Little Bob is playing a game. He wants to win some candies in it - as many as possible.

There are 4 piles, each pile contains N candies. Bob is given a basket which can hold at most 5 candies. Each time, he puts a candy at the top of one pile into the basket, and if there're two candies of the same color in it ,he can take both of them outside the basket and put them into his own pocket. When the basket is full and there are no two candies of the same color, the game ends. If the game is played perfectly, the game will end with no candies left in the piles.

For example, Bob may play this game like this (N=5):

Step1 | Initial Piles | Step2 | Take one from pile #2 | ||

Piles | Basket | Piles | Basket | ||

1 2 3 4 1 5 6 7 2 3 3 3 4 9 8 6 8 7 2 1 | nothing | nothing | 1 3 4 1 5 6 7 2 3 3 3 4 9 8 6 8 7 2 1 | 2 | nothing |

Step3 | Take one from pile #2 | Step4 | Take one from pile #3 | ||

Piles | Basket | Piles | Basket | ||

1 3 4 1 6 7 2 3 3 3 4 9 8 6 8 7 2 1 | 2 5 | nothing | 1 4 1 6 7 2 3 3 3 4 9 8 6 8 7 2 1 | 2 3 5 | nothing |

Step5 | Take one from pile #2 | Step6 | put two candies into his pocket | ||

Piles | Basket | Piles | Basket | ||

1 4 1 6 7 2 3 3 4 9 8 6 8 7 2 1 | 2 3 3 5 | nothing | 1 4 1 6 7 2 3 3 4 9 8 6 8 7 2 1 | 2 5 | a pair of 3 |

Note that different numbers indicate different colors, there are 20 kinds of colors numbered 1..20.

'Seems so hard...'Bob got very much puzzled. How many pairs of candies could he take home at most?

The input will contain no more than 10 test cases. Each test case begins with a line containing a single integer n(1<=n<=40) representing the height of the piles. In the following n lines, each line contains four integers xi1,xi2,xi3,xi4 (in the range 1..20). Each integer indicates the color of the corresponding candy. The test case containing n=0 will terminate the input, you should not give an answer to this case.

提交代码