






from itertools import count





def 		__UpperCAmelCase     (	a_ = 50):
							snake_case_           =				[1] * min_block_length

							for n in count(a_):
														fill_count_functions.append(1)

														for block_length in range(a_				,	n + 1):
																					for block_start in range(n - block_length):
																												fill_count_functions[n] += fill_count_functions[
																												    n - block_start - block_length - 1
																												]

																					fill_count_functions[n] += 1

														if fill_count_functions[n] > 1_00_00_00:
																					break

							return n


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













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





