Have you heard the fact “The base of every normal number system is 10”? Of course, I am not talking about number systems like Stern Brockot Number System. This problem has nothing to do with this fact but may have some similarity. You will be given an N based integer number R and you are given the guaranty that R is divisible by (N − 1). You will have to print the smallest possible value for N. The range for N is 2 ≤ N ≤ 62 and the digit symbols for 62 based number is (0..9 and A..Z and a..z). Similarly, the digit symbols for 61 based number system is 0..9 and A..Z and a..y) and so on.

For each test case output one line ‘Test #t: S’. Where (t) is the test number starting from 1. Line (S) is equal to ‘Symmetric’ if matrix is symmetric and ‘Non-symmetric’ in any other case.