






def 		__UpperCAmelCase     (	a_):
							snake_case_           =				len(a_)
							snake_case_           =				sum(a_)

							snake_case_           =				[[False for x in range(s + 1)] for y in range(n + 1)]

							for i in range(1				,	n + 1):
														snake_case_           =				True

							for i in range(1				,	s + 1):
														snake_case_           =				False

							for i in range(1				,	n + 1):
														for j in range(1				,	s + 1):
																					snake_case_           =				dp[i][j - 1]

																					if arr[i - 1] <= j:
																												snake_case_           =				dp[i][j] or dp[i - 1][j - arr[i - 1]]

							for j in range(int(s / 2)				,	-1				,	-1):
														if dp[n][j] is True:
																					snake_case_           =				s - 2 * j
																					break

							return diff













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() = }')





