CF1873B.Good Kid

Slavic is preparing a present for a friend's birthday. He has an array $a$ of $n$ digits and the present will be the product of all these digits. Because Slavic is a good kid who wants to make the biggest product possible, he wants to add $1$ to exactly one of his digits.

What is the maximum product Slavic can make?

斯拉维克正在为朋友的生日准备一份礼物。他有一个由 $n$ 个数字组成的数组 $a$，而这份礼物的价值将等于这些数字的乘积。由于斯拉维克是个好孩子，希望使乘积尽可能大，他打算恰好对其中一个数字加 $1$。

斯拉维克所能得到的最大乘积是多少？

The first line contains a single integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases.

The first line of each test case contains a single integer $n$ ($1 \leq n \leq 9$) — the number of digits.

The second line of each test case contains $n$ space-separated integers $a_i$ ($0 \leq a_i \leq 9$) — the digits in the array.

第一行包含一个整数 $t$（$1 \leq t \leq 10^4$）—— 测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 9$）—— 数字的位数。

每个测试用例的第二行包含 $n$ 个以空格分隔的整数 $a_i$（$0 \leq a_i \leq 9$）—— 数组中的数字。

For each test case, output a single integer — the maximum product Slavic can make, by adding $1$ to exactly one of his digits.

对于每个测试用例，输出一个整数——Slavic 通过对他的某一位数字恰好加 $1$ 所能得到的最大乘积。