
'''simple docstring'''
from collections import defaultdict






def      UpperCamelCase_				(      A__  ,      A__						):
	a_      				=						first_str.lower().strip()
	a_      				=						second_str.lower().strip()

	# Remove whitespace
	a_      				=						first_str.replace(""" """  ,      """"""						)
	a_      				=						second_str.replace(""" """  ,      """"""						)

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

	# Default values for count should be 0
	a_      				=						defaultdict(A__						)

	# For each character in input strings,
	# increment count in the corresponding
	for i in range(len(A__						)						):
		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()
		lowercase__											=input('Enter the first string ').strip()
		lowercase__											=input('Enter the second string ').strip()

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


'''simple docstring'''
from typing import Any







class   a_ :




			def __init__(       self					,   UpperCAmelCase	):
				a_      				=						data
				a_      				=						None







class   a_ :




			def __init__(       self	):
				a_      				=						None




			def 					lowerCAmelCase__					(       self	):
				a_      				=						self.head
				while temp is not None:
					print(temp.data					,   end=""" """	)
					a_      				=						temp.next
				print()




			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase	):
				a_      				=						Node(UpperCAmelCase	)
				a_      				=						self.head
				a_      				=						new_node






			def 					lowerCAmelCase__					(       self					,   UpperCAmelCase					,   UpperCAmelCase	):
				if node_data_a == node_data_a:
					return
				else:
					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					a_      				=						self.head
					while node_a is not None and node_a.data != node_data_a:
						a_      				=						node_a.next

					if node_a is None or node_a is None:
						return

					a_				,  a_      				=						node_a.data, node_a.data


if __name__ == "__main__":
		lowercase__											=LinkedList()
		for i in range(5, 0, -1):
				ll.push(i)

		ll.print_list()

		ll.swap_nodes(1, 4)
		print('After swapping')
		ll.print_list()
