
def  a_	( __lowercase     :			int ,      __lowercase     :			int				)				->						int:
			_snake_case						=    1.0
			for i in range(1 ,      r + 1				):
						ret *= (n + 1 - i) / i
			return round(__lowercase				)






def  a_	( __lowercase     :			int				)				->						int:
			return choose(8 + n ,      __lowercase				) + choose(9 + n ,      __lowercase				) - 10






def  a_	( __lowercase     :			int				)				->						int:
			return sum(non_bouncy_exact(__lowercase				) for i in range(1 ,      n + 1				)				)






def  a_	( __lowercase     :			int = 100				)				->						int:
			return non_bouncy_upto(__lowercase				)


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

def  a_	( __lowercase     :			int				)				->						bool:
			_snake_case						=    9

			while num > 0:
						if num % 10 != digit:
									return False
						num //= 100
						digit -= 1

			return True






def  a_	( )				->						int:
			_snake_case						=    138_902_663

			while not is_square_form(num * num				):
						if num % 10 == 3:
									num -= 6  # (3 - 6) % 10 = 7
						else:
									num -= 4  # (7 - 4) % 10 = 3

			return num * 10


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