You are given two vectors ~v_{1} = (x_{1}, x_{2}, ..., x_{n})~ and ~v_{2} = (y_{1}, y_{2}, ..., y_{n})~. The scalar product of these vectors is a single number, calculated as ~x_{1}y_{1} + x_{2}y_{2} + ... + x_{n}y_{n}~.

Suppose you are allowed to permute the coordinates of each vector as you wish. Choose two permutations such that the scalar product of your two new vectors is the smallest possible, and output that minimum scalar product.

Input Specification

The first line of the input file contains integer number ~T~ - the number of test cases. For each test case, the first line contains integer number ~n~. The next two lines contain ~n~ integers each, giving the coordinates of ~v_{1}~ and ~v_{2}~ respectively.

Output Specification

For each test case, output a line Case #X: Y where ~X~ is the test case number, starting from 1, and ~Y~ is the minimum scalar product of all permutations of the two given vectors.

Limits

Time limit: 30 seconds per test set.

Memory limit: 1 GB.

Small Dataset

• ~T = 1000~
• ~1 \le n \le 8~
• ~-1000 \le x_{i}, y_{i} \le 1000~

Large Dataset

• ~T = 10~
• ~100 \le n \le 800~
• ~-10\,0000 \le x_{i}, y_{i} \le 10\,0000~

Sample Input

2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1

Sample Output

Case #1: -25
Case #2: 6