Euclid may have been the first to prove that there are infinitely many primes. Let's walk through his proof, as even today, it's regarded as an excellent model of reasoning.

Let us assume the converse, that there only a finite number of primes: p₁, p₂, ... p_n. Let m = 1 + _i=1Πⁿ p_i, i.e. the product of all of these primes plus one. Since this number is bigger than any of the primes on our list, m must be composite. Therefore, some prime must divide it. But which prime? In fact, m leaves a reminder of 1 when divided by any prime p_i, for 1 <= i <= n. Thus, p₁, p₂, ... p_n cannot be the complete list of primes, because if so m must also be a prime. Since this contradicts the assumption it means there cannot exist such a complete list of primes; therefore the number of primes must be infinite!

Your mathematician friend Wannabe_Fermat has come up with a conjecture which he keeps telling to anyone who is willing to lend an ear: "The number m that we come up with when multiplying any n distinct prime numbers and adding 1 to this result is also a prime". You as Wannabe_Zuckerburg, are becoming jealous as your friend's conjecture is gaining popularity and decide to come up with a program that finds counter-examples to shut him up forever.

Input

The first line contains T, the number of test cases. Each test case consists of two lines, the first line containing the number n - the number of primes in our list, and second line containing n space-separated prime numbers. Moreover, following things can be safely assumed:

1 <= T <= 10

n will be at most 9 and m can be contained in 32-bits.

Output

For each input case x, the output is of the format "Case #x: y", where y = m if m is a prime, else y is the largest prime factor of m.

Example

Input:
2
3
2 3 5
4
2 7 5 11

Output:
Case #1: 31
Case #2: 257

Explanation

Case #1 - 31 is a prime number

Case #2 - 2*5*7*11 + 1 = 771, which can be written as 3*257.