6359：Just So You Know

Matthew is a wise man and Jesse is his best friend. One day, Jesse gave Mattew an integer sequence $A$ of length $n$ and marked one continuous subsequence $B$ of $A$ privately. Mattew didn't know the sequence $B$ at first, but he can guess out the sequence by conjectures. That is, once he claims some conjecture, Jesse will immediately tell him whether the conjecture is true or not.

Matthew has known the sequence $B$ is an interval selected from the sequence $A$ with equal probability. A wise man is never confused, so Matthew will minimize the expected number of conjectures he needs to figure out the sequence $B$. Could you please determine that expected value? Your answer should be an irreducible fraction $p / q$, which means $p$ and $q$ are coprime.

The first line contains one integer $T$, indicating the number of test cases.
The following lines describe all the test cases. For each test case:
The first line contains one integer $n$.
The second line contains $n$ space-separated integers $A_1, A_2, \cdots, A_n$.
$1 \leq T \leq 1000$, $1 \leq n \leq 10^6$, $0 \leq A_i < 100$ $(i = 1, 2, \cdots, n)$.
It is guaranteed that the sum of $n$ in all test cases does not exceed $10^7$ and the size of the standard input file does not exceed $24$ MiB.

For each test case, print in one line the answer as an irreducible fraction $p / q$ if $q \neq 1$ or a simple $p$ otherwise.