






def 						snake_case      (UpperCAmelCase__						) ->       int:
  UpperCamelCase_:      str					   =       0
  for plain_chr in plain_text:
    UpperCamelCase_:      str					   =       (
        ord(UpperCAmelCase__						) + (hash_value << 6) + (hash_value << 1_6) - hash_value
    )
  return hash_value







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())