Anagram Transformation Checker

Given two strings \(s_1\) and \(s_2\), determine if \(s_1\) can be transformed into \(s_2\) by rearranging its characters. In other words, check if \(s_1\) and \(s_2\) are anagrams. This can be formally expressed as:

$$sorted(s_1) = sorted(s_2)$$

Note that both strings consist of printable characters.

inputFormat

The input consists of two lines:

• The first line contains the string \(s_1\).
• The second line contains the string \(s_2\).

outputFormat

Output a single line: "True" if \(s_1\) can be transformed into \(s_2\) by rearranging its characters, otherwise "False".

listen
silent

True