Problem Statement  
A string X is an anagram of string Y if X can be obtained by arranging all characters of Y in some order, without removing any characters and without adding new characters. For example, each of the strings "baba", "abab", "aabb" and "abba" is an anagram of "aabb", and strings "aaab", "aab" and "aabc" are not anagrams of "aabb".
A set of strings is anagramfree if it contains no pair of strings which are anagrams of each other. Given a set of strings S, return the size of its largest anagramfree subset. Note that the entire set is considered a subset of itself.  
Definition  
 
Constraints  
  S will contain between 1 and 50 elements, inclusive.  
  Each element of S will contain between 1 and 50 characters, inclusive.  
  Each element of S will consist of lowercase letters ('a''z') only.  
  All elements of S will be distinct.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
