



__A   			={str(digit): digit**5 for digit in range(1_0)}

def        a						(      _UpperCAmelCase							:					int						):







		'''simple docstring'''





		return sum(DIGITS_FIFTH_POWER[digit] for digit in str(_UpperCAmelCase						)						)

def        a						(      ):







		'''simple docstring'''





		return sum(
		    number
		    for number in range(10_00 ,   1_00_00_00						)
		    if number == digits_fifth_powers_sum(_UpperCAmelCase						)						)


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






from collections import defaultdict




def       _snake_case	(   lowerCAmelCase							:   int	):
		"""simple docstring"""







		SCREAMING_SNAKE_CASE_  :		Any				      =    1
		SCREAMING_SNAKE_CASE_  :		Tuple				      =    True
		for v in tree[start]:
				if v not in visited:
						ret += dfs(lowerCAmelCase	)
		if ret % 2 == 0:
				cuts.append(lowerCAmelCase	)
		return ret




def       _snake_case	(   ):
		"""simple docstring"""







		dfs(1	)


if __name__ == "__main__":
		__lowerCamelCase   ,						__lowerCamelCase					:	Union[str, Any]       =  10, 9
		__lowerCamelCase					:	Optional[int]       =  defaultdict(list)
		__lowerCamelCase					:	dict[int, bool]       =  {}
		__lowerCamelCase					:	list[int]       =  []
		__lowerCamelCase					:	Optional[Any]       =  0
		__lowerCamelCase					:	Any       =  [(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (10, 8)]
		for u, v in edges:
				tree[u].append(v)
				tree[v].append(u)
		even_tree()
		print(len(cuts) - 1)
