




from __future__ import annotations




def 		lowerCAmelCase_ (						lowerCamelCase ):
				if len(lowerCamelCase ) < 2:
								raise ValueError("""Monogons and Digons are not polygons in the Euclidean space""" )
				if any(i <= 0 for i in nums ):
								raise ValueError("""All values must be greater than 0""" )
				__magic_name__						:						int										=nums.copy()
				copy_nums.sort()
				return copy_nums[-1] < sum(copy_nums[:-1] )


if __name__ == "__main__":
							import doctest

							doctest.testmod()












def 		__UpperCAmelCase     (	a_ = 10**9):
							snake_case_           =				1
							snake_case_           =				2

							snake_case_           =				0
							snake_case_           =				0
							snake_case_           =				0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

														snake_case_           =				2 * value + 2 if i % 2 == 0 else 2 * value - 2
														i += 1

							return perimeters_sum


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





