






def 						snake_case      (UpperCAmelCase__						) ->       bool:
  UpperCamelCase_:      int					   =       9

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

  return True

def 						snake_case      () ->       int:
  UpperCamelCase_:      Dict					   =       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() = }''')







from math import factorial

def 						snake_case      (UpperCAmelCase__			,					UpperCAmelCase__						) ->       Dict:
  return factorial(UpperCAmelCase__						) / (factorial(UpperCAmelCase__						) * factorial(n - r						))

def 						snake_case      () ->       Optional[Any]:
  UpperCamelCase_:      int					   =       0

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


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