



"""simple docstring"""


snake_case_         = (1, 153, 370, 371, 1634, 2467_8051, 115_1322_1901_8763_9925_6509_5597_9739_7152_2401)
snake_case_         = (-153, -1, 0, 1.2, 200, "A", [], {}, None)

def 				_lowerCAmelCase   (     lowercase_		):
						if not isinstance(lowercase_	,			lowercase_		) or n < 1:
												return False

						# Initialization of sum and number of digits.
						UpperCAmelCase    =				0
						UpperCAmelCase    =				0
						UpperCAmelCase    =				n
						# Calculation of digits of the number
						while temp > 0:
												number_of_digits += 1
												temp //= 10
						# Dividing number into separate digits and find Armstrong number
						UpperCAmelCase    =				n
						while temp > 0:
												UpperCAmelCase    =				temp % 10
												total += rem**number_of_digits
												temp //= 10
						return n == total

def 				_lowerCAmelCase   (     lowercase_		):
						if not isinstance(lowercase_	,			lowercase_		) or n < 1:
												return False

						# Init a "histogram" of the digits
						UpperCAmelCase    =				[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
						UpperCAmelCase    =				0
						UpperCAmelCase    =				0
						UpperCAmelCase    =				n
						while temp > 0:
												UpperCAmelCase   ,					UpperCAmelCase    =				divmod(lowercase_	,			10		)
												digit_histogram[rem] += 1
												digit_total += 1

						for cnt, i in zip(lowercase_	,			range(len(lowercase_		)		)		):
												total += cnt * i**digit_total

						return n == total

def 				_lowerCAmelCase   (     lowercase_		):
						if not isinstance(lowercase_	,			lowercase_		) or n < 1:
												return False
						UpperCAmelCase    =				len(str(lowercase_		)		)  # the power that all digits will be raised to
						# check if sum of each digit multiplied expo times is equal to number
						return n == sum(int(lowercase_		) ** expo for i in str(lowercase_		)		)

def 				_lowerCAmelCase   (     ):
						UpperCAmelCase    =				int(input('Enter an integer to see if it is an Armstrong number: '		).strip()		)
						print(F"""{num} is {'' if armstrong_number(lowercase_		) else 'not '}an Armstrong number."""		)
						print(F"""{num} is {'' if narcissistic_number(lowercase_		) else 'not '}an Armstrong number."""		)
						print(F"""{num} is {'' if pluperfect_number(lowercase_		) else 'not '}an Armstrong number."""		)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				main()










"""simple docstring"""


from collections import Counter

def 				_lowerCAmelCase   (     lowercase_		):
						return sum(socks_by_color // 2 for socks_by_color in Counter(lowercase_		).values()		)


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				snake_case_         = [int(x) for x in input("""Enter socks by color :""").rstrip().split()]
				print(f'''sock_merchant({colors}) = {sock_merchant(colors)}''')





