Write a program that checks if two strings are anagrams. Consider that an anagram of a string is a permutation of this string ignoring capitalization and whitespaces.