public class Solution {

public static boolean isAnagram(String a, String b) {
        // Complete the function
        if( a == null || b == null || (a.length() != b.length()) ||  a.isEmpty() || b.isEmpty() ) {
            return false;
        }
        java.util.HashMap<String, Integer> map1 = new  java.util.HashMap<>();
        java.util.HashMap<String, Integer> map2 = new  java.util.HashMap<>();
        a.chars().mapToObj(i -> String.valueOf((char) i)).forEach(e -> map1.put(e.toLowerCase(), map1.getOrDefault(e.toLowerCase(), 0)+1));
        b.chars().mapToObj(i -> String.valueOf((char) i)).forEach(e -> map2.put(e.toLowerCase(), map2.getOrDefault(e.toLowerCase(), 0)+1));
        //System.out.println(map1);
        for(String s: b.split("")) {
            Integer count1 = map1.get(s);
            Integer count2 = map2.get(s);
            if(count1 == null || count2 == null) {
                return false;
            }
            if(!count1.equals(count2)) {
                return false;
            }
        }
        return true;
    }

 public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        String a = scan.next();
        String b = scan.next();
        scan.close();
        boolean ret = isAnagram(a, b);
        System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
    }

}