code: 
  
  from itertools import combinations_with_replacement
  def 		SCREAMING_SNAKE_CASE__				(							_UpperCAmelCase = 100				)					-> int:
  
  
  
      '''simple docstring'''
  
  
  
  
  
  
      lowerCAmelCase				:			list[int]    			=      [*list(range(1,      21				)				), 25]
      lowerCAmelCase				:			list[int]    			=      [2 * x for x in range(1,      21				)] + [50]
      lowerCAmelCase				:			list[int]    			=      [3 * x for x in range(1,      21				)]
      lowerCAmelCase				:			list[int]    			=      singles + doubles + triples + [0]
  
      lowerCAmelCase				:			int    			=      0
      lowerCAmelCase				:			int
      lowerCAmelCase				:			int
      lowerCAmelCase				:			int
      lowerCAmelCase				:			int
  
      for double in doubles:
          for throwa, throwa in combinations_with_replacement(_UpperCAmelCase,      2				):
              lowerCAmelCase				:			Union[str, Any]    			=      double + throwa + throwa
              if checkout_total < limit:
                  num_checkouts += 1
  
      return num_checkouts
  
  
  if __name__ == "__main__":
   print(F'{solution() = }')
  
  
  
  
  
  
style_context: 
  
  from __future__ import annotations
  def 		SCREAMING_SNAKE_CASE__				(							_UpperCAmelCase				)					-> set[int]:
  
  
  
      '''simple docstring'''
  
  
  
  
  
  
      lowerCAmelCase				:			List[str]    			=      {1}
      lowerCAmelCase				:			int    			=      [1]
      for _ in range(2,      depth + 1				):
          lowerCAmelCase				:			str    			=      [*previous_coefficients, 0]
          lowerCAmelCase				:			Optional[int]    			=      [0, *previous_coefficients]
          lowerCAmelCase				:			Tuple    			=      []
          for x, y in zip(_UpperCAmelCase,      _UpperCAmelCase				):
              coefficients.add(x + y				)
              previous_coefficients.append(x + y				)
      return coefficients
  def 		SCREAMING_SNAKE_CASE__				(							_UpperCAmelCase				)					-> set[int]:
  
  
  
      '''simple docstring'''
  
  
  
  
  
  
      lowerCAmelCase				:			str    			=      set()
      for number in unique_coefficients:
          lowerCAmelCase				:			Dict    			=      2
          lowerCAmelCase				:			Tuple    			=      number
          while divisor**2 <= copy_number:
              lowerCAmelCase				:			List[str]    			=      0
              while copy_number % divisor == 0:
                  copy_number //= divisor
                  multiplicity += 1
              if multiplicity >= 2:
                  non_squarefrees.add(_UpperCAmelCase				)
                  break
              divisor += 1
  
      return unique_coefficients.difference(_UpperCAmelCase				)
  def 		SCREAMING_SNAKE_CASE__				(							_UpperCAmelCase = 51				)					-> int:
  
  
  
      '''simple docstring'''
  
  
  
  
  
  
      lowerCAmelCase				:			int    			=      get_pascal_triangle_unique_coefficients(_UpperCAmelCase				)
      lowerCAmelCase				:			Optional[int]    			=      get_squarefrees(_UpperCAmelCase				)
      return sum(_UpperCAmelCase				)
  
  
  if __name__ == "__main__":
   print(F'{solution() = }')
  
  
  
  
  
  