% Problem author: ??? / GCJ 2008 Round 1A, problem A

\begin{problem}{Scalar product}
{product.in}{product.out}
{2 секунды}{256 мегабайт}

You are given two vectors $v_1 = (x_1, x_2, \ldots, x_n)$ and
$v_2 = (y_1, y_2, \ldots, y_n)$. The scalar product of these vectors
is a single number, calculated as $x_1 y_1 + x_2 y_2 + \ldots + 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.

$1 \leq n \leq 800$.
$-100000 \leq x_i, y_i \leq 100000$.

\InputFile

The first line of the input file contains integer number $t$ --- the number
of test cases to solve.
$t$ test cases follow, each containing $3$ lines each. The first line of
a test case contains integer number $n$. The next two lines contain $n$
integers each, giving the coordinates of $v_1$ and $v_2$ respectively.

\OutputFile

For each test case output a line containing test case number and a single
integer --- minimum scalar product of all permutations
of the two given vectors.

Follow sample output format.

\Example

\begin{example}
\exmp{
2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1
}{
Case \#1: -25
Case \#2: 6
}%
\end{example}

\end{problem}
