Anagram Checker

Given two strings, check if they are anagrams of each other. Two strings are anagrams if they contain the same characters in the same frequency. The checking should be case-sensitive and consider an empty string as a valid anagram of another empty string.

You are required to read the input strings from standard input and output the result to standard output. The output should be 'Anagram' if the input strings are anagrams, or 'Not Anagram' otherwise.

The decision is based on the equivalence between the sorted order of the characters in each string, i.e. ( sorted(s_1) = sorted(s_2) ).

inputFormat

The input consists of two lines. The first line contains the first string ( s_1 ) and the second line contains the second string ( s_2 ).

outputFormat

Output a single line containing either 'Anagram' if the two strings are anagrams, or 'Not Anagram' otherwise.## sample

listen
silent

Anagram