Farmer John's cows have been holding a daily online gathering on the "mooZ" video meeting platform. For fun, they have invented a simple number game to play during the meeting to keep themselves entertained.
Elsie has three positive integers A,B,C (1≤A≤B≤C). These integers are supposed to be secret, so she will not directly reveal them to her sister Bessie. Instead, she tells Bessie n distinct integers x1,x2,..,xn (1≤xi≤109), claiming that each xi is one of A,B,C,A+B,B+C,C+A,A+B+C. However, Elsie may be lying; the integers xi might not correspond to any valid triple (A,B,C).
This is too hard for Bessie to wrap her head around, so it is up to you to determine the number of triples (A,B,C) that are consistent with the numbers Elsie presented (possibly zero).
The first line contains the number of test cases t (1≤t≤100).
Each test case starts with n (4≤n≤7), the number of integers Elsie gives to Bessie.
The second line of each test case contains n distinct integers x1,x2,..,xn.
For each test case, output the number of triples (A,B,C) that are consistent with the numbers Elsie presented.
For x={4,5,7,9}, the five possible triples are as follows: (2,2,5),(2,3,4),(2,4,5),(3,4,5),(4,5,7).