The Kingdom of Gridland contains provinces. Each province is defined as a grid where each cell in the grid represents a city. Every cell in the grid contains a single lowercase character denoting the first character of the city name corresponding to that cell.
From a city with the coordinates , it is possible to move to any of the following cells in unit of time (provided that the destination cell is within the confines of the grid):
A knight wants to visit all the cities in Gridland. He can start his journey in any city and immediately stops his journey after having visited each city at least once. Moreover, he always plans his journey in such a way that the total time required to complete it is minimum.
After completing his tour of each province, the knight forms a string by concatenating the characters of all the cells in his path. How many distinct strings can he form in each province?
Input Format
The first line contains a single integer, , denoting the number of provinces. The subsequent lines describe each province over the following three lines:
The first line contains an integer, , denoting the number of columns in the province.
Each of the next two lines contains a string, , of length denoting the characters for the first and second row of the province.
Constraints
Output Format
For each province, print the number of distinct strings the knight can form on a new line.
Sample Input
3
1
a
a
3
dab
abd
5
ababa
babab
Sample Output
1
8
2
Explanation
Province 0:
The knight can only form one string (aa), so we print on a new line.
Province 1:
The knight can form eight different strings (abdbad, adabdb, badabd, bdbada, dababd, dabdba, dbabad, and dbadab), so we print on a new line.
Province 2:
The knight can form two different strings (ababababab and bababababa), so we print on a new line.