Yet Another Mapping Problem

Consider the alphabets that are bidirectionally mapped to each other in the following manner - $A$ is mapped to $Z$. - $B$ is mapped to $Y$. - $C$ is mapped to $X$ and so on. Given two strings of equal length $N$, $S$(the original string) and $T$(the mapped string), check whether the mapping has been done correctly. Print $true$ if the mapping has been correctly executed, else print $false$. **N