



'''simple docstring'''

def    __lowercase	(_SCREAMING_SNAKE_CASE   :Tuple							):

				if length <= 0 or not isinstance(_SCREAMING_SNAKE_CASE     ,						_SCREAMING_SNAKE_CASE							):
								raise ValueError('''Length must be a positive integer.'''							)
				return [n * (2 * n - 1) for n in range(_SCREAMING_SNAKE_CASE							)]


if __name__ == "__main__":
	print(hexagonal_numbers(length=5))
	print(hexagonal_numbers(length=10))








'''simple docstring'''






def    _snake_case  (	A			)		->       int:
							if n == 1 or not isinstance(A					,       A			):
														return 0
							elif n == 2:
														return 1
							else:
														lowerCAmelCase__			  =      [0, 1]
														for i in range(2					,       n + 1			):
																					sequence.append(sequence[i - 1] + sequence[i - 2]			)

														return sequence[n]


def    _snake_case  (	A			)		->       int:
							lowerCAmelCase__			  =      0
							lowerCAmelCase__			  =      2

							while digits < n:
														index += 1
														lowerCAmelCase__			  =      len(str(fibonacci(A			)			)			)

							return index


def    _snake_case  (	A = 1000			)		->       int:
							return fibonacci_digits_index(A			)


if __name__ == "__main__":
		print(solution(int(str(input()).strip())))