






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







						lowerCAmelCase__       =						1
						for i in range(1    ,   num + 1   ):
												fact *= i
						return fact


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







						lowerCAmelCase__       =						0
						while number > 0:
												lowerCAmelCase__       =						number % 10
												sum_of_digits += last_digit
												lowerCAmelCase__       =						number // 10  # Removing the last_digit from the given number
						return sum_of_digits


def        _a  (     UpperCamelCase_					:				int = 100   ) ->   int:
						"""simple docstring"""







						lowerCAmelCase__       =						factorial(UpperCamelCase_   )
						lowerCAmelCase__       =						split_and_add(UpperCamelCase_   )
						return result


if __name__ == "__main__":
	print(solution(int(input('''Enter the Number: ''').strip())))














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() = }")






