8 - Tree Borers
	Tree borers are nasty bugs that chew holes into trees.  Imagine following the twisting path of a borer from entry to exit, observing the thicknesses of the tree rings along the way (actual thickness, not the distance of the possibly slanted path through a tree ring).  Your challenge is to determine how many possible routes could have been taken by the tree borer, given only the sequence of tree ring thicknesses.  You may assume that a tree ring is of the same thickness all the way around the tree.  Note that some rings may be of the same thickness and there may even be some “palindromic” sequences!
Input:
There will be multiple cases.  The first line of input contains a positive integer designating the number of cases.  Each subsequent line represents one of the cases.  The first integer in a case indicates the number of tree rings traversed from entry to exit of the tree.  This is followed by the thickness (integer value) of each ring that is traversed.   You may assume that any ring that is entered is fully traversed (otherwise one could not determine the thickness of the ring!) and a ring is listed twice in succession if the tree borer turns around after chewing through it and starts chewing the other way again.  This implies that if the borer chews into the center “ring”, the thickness (radius) will be listed twice, once going in (to dead center) and once coming out.
Output:
For each case print how many different possible routes the tree borer could have taken.  You may assume that this number can be represented as an integer in your program.  Number each case as in the example.
Sample Input:
2
6       2  1  1  1  1  2
6       1  1  1  1  1  1
Sample Output:
1.  2
2.  5