




from itertools import combinations_with_replacement



def    UpperCAmelCase__	(  lowerCamelCase = 100 ):
  lowercase     :list[int]   						=    [*list(range(1,      21 ) ), 25]
  lowercase     :list[int]   						=    [2 * x for x in range(1,      21 )] + [50]
  lowercase     :list[int]   						=    [3 * x for x in range(1,      21 )]
  lowercase     :list[int]   						=    singles + doubles + triples + [0]

  lowercase     :int   						=    0
  lowercase     :int
  lowercase     :int
  lowercase     :int
  lowercase     :int

  for double in doubles:
    for throwa, throwa in combinations_with_replacement(lowerCamelCase,      2 ):
      lowercase     :Any   						=    double + throwa + throwa
      if checkout_total < limit:
        num_checkouts += 1

  return num_checkouts


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









def    UpperCAmelCase__	(  lowerCamelCase ):
  lowercase     :Optional[int]   						=    len(lowerCamelCase )
  if n in (0, 1):
    return 0
  return sum(query * (n - i - 1) for i, query in enumerate(sorted(lowerCamelCase ) ) )


if __name__ == "__main__":
     import doctest

     doctest.testmod()



