Monocarp has forgotten the password to his mobile phone. The password consists of 44 digits from 00 to 99 (note that it can start with the digit 00).
Monocarp remembers that his password had exactly two different digits, and each of these digits appeared exactly two times in the password. Monocarp also remembers some digits which were definitely not used in the password.
You have to calculate the number of different sequences of 44 digits that could be the password for Monocarp's mobile phone (i. e. these sequences should meet all constraints on Monocarp's password).
The first line contains a single integer tt (1≤t≤2001≤t≤200) — the number of testcases.
The first line of each testcase contains a single integer nn (1≤n≤81≤n≤8) — the number of digits for which Monocarp remembers that they were not used in the password.
The second line contains nn different integers a1,a2,…ana1,a2,…an (0≤ai≤90≤ai≤9) representing the digits that were not used in the password. Note that the digits a1,a2,…,ana1,a2,…,an are given in ascending order.
For each testcase, print one integer — the number of different 44-digit sequences that meet the constraints.
2
8
0 1 2 4 5 6 8 9
1
8
6
216
In the first example, all possible passwords are: "3377", "3737", "3773", "7337", "7373", "7733".