Anagram Checker

Given two input strings, determine whether one string is an anagram of the other. An anagram is a word or phrase formed by rearranging the letters of another, using all the original letters exactly once.

The check is case-sensitive and takes into account all characters, including punctuation and whitespace. In formal terms, given two strings \( s_1 \) and \( s_2 \), they are anagrams if and only if \[ sorted(s_1) = sorted(s_2), \] where sorted(s) denotes the string s sorted in non-decreasing order of its characters.

inputFormat

The input consists of two lines read from standard input. The first line contains the first string, and the second line contains the second string.

outputFormat

Output a single line to standard output: True if the two strings are anagrams (i.e. their sorted characters are identical), otherwise False.

god
dog

True