


from itertools import permutations




def      __snake_case       (       lowerCamelCase_ :				int = 5						):
				'''simple docstring'''




				if gon_side < 3 or gon_side > 5:
								raise ValueError("gon_side must be in the range [3, 5]"						)

				# Since it's 16, we know 10 is on the outer ring
				# Put the big numbers at the end so that they are never the first number
				__magic_name__	  = list(range(gon_side + 1	,  0	,  -1						)						)
				__magic_name__	  = list(range(gon_side + 2	,  gon_side * 2 + 1						)						)

				for perm in permutations(small_numbers + big_numbers						):
								__magic_name__	  = generate_gon_ring(lowerCamelCase_	,  list(lowerCamelCase_						)						)
								if is_magic_gon(lowerCamelCase_						):
												return int("".join(str(lowerCamelCase_						) for n in numbers						)						)

				__magic_name__	  = F'Magic {gon_side}-gon ring is impossible'
				raise ValueError(lowerCamelCase_						)




def      __snake_case       (       lowerCamelCase_ :				int	,  lowerCamelCase_ :				list[int]						):
				'''simple docstring'''




				__magic_name__	  = [0] * (gon_side * 3)
				__magic_name__	  = perm[0:3]
				perm.append(perm[1]						)

				__magic_name__	  = 1 if gon_side < 5 else 2

				for i in range(1	,  len(lowerCamelCase_						) // 3 + magic_number						):
								__magic_name__	  = perm[2 * i + 1]
								__magic_name__	  = result[3 * i - 1]
								__magic_name__	  = perm[2 * i + 2]

				return result




def      __snake_case       (       lowerCamelCase_ :				list[int]						):
				'''simple docstring'''




				if len(lowerCamelCase_						) % 3 != 0:
								raise ValueError("a gon ring should have a length that is a multiple of 3"						)

				if min(numbers[::3]						) != numbers[0]:
								return False

				__magic_name__	  = sum(numbers[:3]						)

				return all(sum(numbers[i : i + 3]						) == total for i in range(3	,  len(lowerCamelCase_						)	,  3						)						)


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







'''simple docstring'''
def      __snake_case       (       lowerCamelCase_ :				int = 100						):
				'''simple docstring'''




				__magic_name__	  = [[0 for _ in range(lowerCamelCase_						)] for _ in range(m + 1						)]
				for i in range(m + 1						):
								__magic_name__	  = 1

				for n in range(m + 1						):
								for k in range(1	,  lowerCamelCase_						):
												memo[n][k] += memo[n][k - 1]
												if n > k:
																memo[n][k] += memo[n - k - 1][k]

				return memo[m][m - 1] - 1


if __name__ == "__main__":
						print(solution(int(input('Enter a number: ').strip())))



