


"""simple docstring"""






def 			A__		(					_UpperCAmelCase    :      str	)							->	str:

	'''simple docstring'''


	snake_case__  :						str		=      word.upper()
	snake_case__  :						List[Any]		=      0
	snake_case__  :						Union[str, Any]		=      {}
	snake_case__  :						int		=      []

	for letter in word:
		if letter not in letter_nums:
			snake_case__  :						Tuple		=      str(_UpperCAmelCase	)
			next_num += 1
		word_pattern.append(letter_nums[letter]	)
	return ".".join(_UpperCAmelCase	)


if __name__ == "__main__":
					import pprint
					import time

					lowercase  		=			time.time()
					with open("""dictionary.txt""") as in_file:
										lowercase  		=			in_file.read().splitlines()

					lowercase  		=			{}
					for word in word_list:
										lowercase  		=			get_word_pattern(word)
										if pattern in all_patterns:
															all_patterns[pattern].append(word)
										else:
															lowercase  		=			[word]

					with open("""word_patterns.txt""", """w""") as out_file:
										out_file.write(pprint.pformat(all_patterns))

					lowercase  		=			round(time.time() - start_time, 2)
					print(f"Done!  {len(all_patterns):,} word patterns found in {total_time} seconds.")
					# Done!  9,581 word patterns found in 0.58 seconds.






def 	__lowerCamelCase							(				)      ->       Dict:
	_lowercase   =1

	while True:
		if (
		    sorted(str(__a		)		)
		    == sorted(str(2 * i		)		)
		    == sorted(str(3 * i		)		)
		    == sorted(str(4 * i		)		)
		    == sorted(str(5 * i		)		)
		    == sorted(str(6 * i		)		)
		):
			return i

		i += 1


if __name__ == "__main__":
						print(solution())




