

def  lowerCamelCase__ (					_a):
	if not isinstance(_a							,			_a):
		raise ValueError("Input must be an integer")
	if input_num <= 0:
		raise ValueError("Input must be positive")
	return sum(
	    divisor for divisor in range(1							,			input_num // 2 + 1) if input_num % divisor == 0)


if __name__ == "__main__":
			import doctest

			doctest.testmod()


def  lowerCamelCase__ (					_a = 50):
	SCREAMING_SNAKE_CASE   :      int				     =       [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() = }''')