G. Guaranteeing SP
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

André was responsible for checking the registrations for the Paulista Programming Marathon, and his job was to ensure that the Brazilian state of the registration was indeed São Paulo. The registration system uses the standard ISO 3166-2 codes to represent the main subdivisions of Brazil, as shown in the table below:

Unfortunately, a bug occurred in the system, and all the registration codes had one character replaced by '?', and now you need to help André determine if a certain code with one character replaced by '?' was originally equal to the code for São Paulo (BR-SP) or not.

Input

The input consists of a single line containing one of the $$$27$$$ codes from the table in the statement, but with one character replaced by '?'.

Output

The output consists of a single line with the character 'S' if the original code was definitely the code of São Paulo, or 'N' if it definitely was not the code of São Paulo, or 'T' if it could be the code of São Paulo but it is not possible to be sure about it.

Examples
Input
B?-SP
Output
S
Input
BR-M?
Output
N
Input
BR-S?
Output
T