

def 							__lowerCAmelCase     (							_UpperCamelCase		:	int = 50						)		->				int:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE		    =      [1] * (length + 1)

 for row_length in range(length + 1						):
  for tile_length in range(2		,				5						):
   for tile_start in range(row_length - tile_length + 1						):
    ways_number[row_length] += ways_number[
        row_length - tile_start - tile_length
    ]

 return ways_number[length]


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




def 							__lowerCAmelCase     (							_UpperCamelCase		:	List[str]=2_81_23						)		->				str:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE		    =      [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

 SCREAMING_SNAKE_CASE		    =      set()
 SCREAMING_SNAKE_CASE		    =      0

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

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

 return res


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

