Goro has 4 arms. Goro is very strong. You don't mess with Goro. Goro needs to sort an array of N different integers. Algorithms are not Goro's strength; strength is Goro's strength. Goro's plan is to use the fingers on two of his hands to hold down several elements of the array and hit the table with his third and fourth fists as hard as possible. This will make the unsecured elements of the array fly up into the air, get shuffled randomly, and fall back down into the empty array locations.
Goro wants to sort the array as quickly as possible. How many hits will it take Goro to sort the given array, on average, if he acts intelligently when choosing which elements of the array to hold down before each hit of the table? Goro has an infinite number of fingers on the two hands he uses to hold down the array.
More precisely, before each hit, Goro may choose any subset of the elements of the array to freeze in place. He may choose differently depending on the outcomes of previous hits. Each hit permutes the unfrozen elements uniformly at random. Each permutation is equally likely.
The first line of the input gives the number of test cases, T. T test cases follow. Each one will consist of two lines. The first line will give the number N. The second line will list the N elements of the array in their initial order.
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the expected number of hitthetable operations when following the best holddown strategy. Answers with an absolute or relative error of at most 10^{6} will be considered correct.
1 ≤ T ≤ 100;
The second line of each test case will contain a permutation of the N
smallest positive integers.
1 ≤ N ≤ 10;
1 ≤ N ≤ 1000;
Input 
Output 
3

Case #1: 2.000000

Points  Correct  Attempted 

10pt  2670  4609 
20pt  2568  2649 