Problem Description

Given two strings, determine if they are anagrams of each other. Additionally, find the minimum number of character deletions required to make them anagrams if they are not already anagrams.

Input Format

Two strings on separate lines.

Output Format

If anagrams: "ANAGRAM". If not: "NOT ANAGRAM X" where X is minimum deletions needed.

Constraints

• 1 ≤ string length ≤ 1000

• Strings contain only lowercase letters

• Case-sensitive comparison

• Count minimum deletions from both strings

• Empty strings are anagrams

Sample Input/Output

Explanation

"listen" and "silent" contain the same characters with same frequencies, so they are anagrams.