

from collections import defaultdict





def  __lowerCamelCase     (			UpperCamelCase__       ,							UpperCamelCase__				):







							'''simple docstring'''






							snake_case_          =   first_str.lower().strip()
							snake_case_          =   second_str.lower().strip()

							# Remove whitespace
							snake_case_          =   first_str.replace(' '       ,							''				)
							snake_case_          =   second_str.replace(' '       ,							''				)

							# Strings of different lengths are not anagrams
							if len(UpperCamelCase__				) != len(UpperCamelCase__				):
														return False

							# Default values for count should be 0
							snake_case_          =   defaultdict(UpperCamelCase__				)

							# For each character in input strings,
							# increment count in the corresponding
							for i in range(len(UpperCamelCase__				)				):
														count[first_str[i]] += 1
														count[second_str[i]] -= 1

							return all(_count == 0 for _count in count.values()				)


if __name__ == "__main__":
					from doctest import testmod

					testmod()
					_UpperCAmelCase		:       Union[str, Any]						    =	input("""Enter the first string """).strip()
					_UpperCAmelCase		:       List[str]						    =	input("""Enter the second string """).strip()

					_UpperCAmelCase		:       str						    =	check_anagrams(input_a, input_b)
					print(F'''{input_a} and {input_b} are {"" if status else "not "}anagrams.''')







from math import sqrt





def  __lowerCamelCase     (			UpperCamelCase__				):







							'''simple docstring'''






							snake_case_          =   0
							for i in range(1       ,							int(sqrt(UpperCamelCase__				) + 1				)				):
														if n % i == 0 and i != sqrt(UpperCamelCase__				):
																					total += i + n // i
														elif i == sqrt(UpperCamelCase__				):
																					total += i
							return total - n





def  __lowerCamelCase     (			UpperCamelCase__ = 10000				):







							'''simple docstring'''






							snake_case_          =   sum(
							    i
							    for i in range(1       ,							UpperCamelCase__				)
							    if sum_of_divisors(sum_of_divisors(UpperCamelCase__				)				) == i and sum_of_divisors(UpperCamelCase__				) != i				)
							return total


if __name__ == "__main__":
					print(solution(int(str(input()).strip())))




