






def        _a  (     ) ->   int:
						"""simple docstring"""







						lowerCAmelCase__       =						[]
						lowerCAmelCase__       =						1

						while len(lowerCamelCase__   ) < 1e6:
												constant.append(str(lowerCamelCase__   )   )
												i += 1

						lowerCAmelCase__       =						"".join(lowerCamelCase__   )

						return (
						    int(constant[0]   )
						    * int(constant[9]   )
						    * int(constant[99]   )
						    * int(constant[999]   )
						    * int(constant[9_999]   )
						    * int(constant[99_999]   )
						    * int(constant[999_999]   )
						)


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










from collections import defaultdict
from math import ceil, sqrt


def        _a  (     UpperCamelCase_					:				int = 1_000_000    ,   UpperCamelCase_					:				int = 10   ) ->   int:
						"""simple docstring"""







						lowerCAmelCase__       =						defaultdict(UpperCamelCase_   )

						for outer_width in range(3    ,   (t_limit // 4) + 2   ):
												if outer_width * outer_width > t_limit:
																		lowerCAmelCase__       =						max(
																		    ceil(sqrt(outer_width * outer_width - t_limit   )   )    ,   1   )
												else:
																		lowerCAmelCase__       =						1

												hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

												for hole_width in range(UpperCamelCase_    ,   outer_width - 1    ,   2   ):
																		count[outer_width * outer_width - hole_width * hole_width] += 1

						return sum(1 for n in count.values() if 1 <= n <= 10   )


if __name__ == "__main__":
	print(F"{solution() = }")






