

def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    List[Any]=28_123			):



     '''simple docstring'''





     lowercase__    :   List[str]      =       [1] * (limit + 1)

     for i in range(2	,     int(limit**0.5			) + 1			):
          sum_divs[i * i] += i
          for k in range(i + 1	,     limit // i + 1			):
               sum_divs[k * i] += k + i

     lowercase__    :   List[Any]      =       set()
     lowercase__    :   Tuple      =       0

     for n in range(1	,     limit + 1			):
          if sum_divs[n] > n:
               abundants.add(_lowerCamelCase			)

          if not any((n - a in abundants) for a in abundants			):
               res += n

     return res


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


"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int = 50	)       ->      int:
  _lowerCAmelCase						:       int  			=     [1] * (length + 1)

  for row_length in range(3			,length + 1	):
    for block_length in range(3			,row_length + 1	):
      for block_start in range(row_length - block_length	):
        ways_number[row_length] += ways_number[
            row_length - block_start - block_length - 1
        ]

      ways_number[row_length] += 1

  return ways_number[length]


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




