




from math import factorial




def      __magic_name__							(					A						:   int,    A						:   Dict  ):






			'''simple docstring'''







			return factorial(A__  ) / (factorial(A__  ) * factorial(n - r  ))




def      __magic_name__							(					):






			'''simple docstring'''







			a       =     0

			for i in range(1,    101  ):
						for j in range(1,    i + 1  ):
									if combinations(A__,    A__  ) > 1E6:
												total += 1
			return total


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










def 	A (		A__			):
     UpperCAmelCase    :					Dict			=      9

     while num > 0:
          if num % 1_0 != digit:
               return False
          num //= 1_0_0
          digit -= 1

     return True







def 	A (		):
     UpperCAmelCase    :					Optional[Any]			=      1_3_8_9_0_2_6_6_3

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

     return num * 1_0


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



