Problem Description
A thief stole a big diamond in a party. The diamond was in the door of the house. So everyone can tell if there is a diamond when he enter and exit the house.
The cop think that the thief must be one of the guests. So they have got the timetable of the entrance time and exit time of everyone. They are arranging how to ask them to know who is the thief. When ask somebody, the cop could know if the diamond was still being there when they entering and exiting.
Of course, thief will tell lie. To simplify the problem, the thief will always tell you that the diamond was there. To simplify the problem, we assume that the thief stole the diamond when he exit.
The cop want to ask as few people as possible. Please help them to find the minimum number of guests they have to ask.
Input
The first line contains a single positive integer T( T <= 100 ), indicates the number of test cases.
For each test case: First line contains an integer N(1<=N<=25), indicates the number of Guests
The Timetable of the party - 2N numbers, 1-N each one twice, the first appearance means he enter. the second appearance means he exit.
Output
For each test case: output the case number as shown and the minimum number of guests they have to ask.
Sample Input
4
1
1 1
2
1 1 2 2
4
1 1 2 2 3 3 4 4
5
1 4 4 2 5 5 3 3 2 1
Sample Output
Case #1: 0
Case #2: 1
Case #3: 2
Case #4: 2
