




from __future__ import annotations


class 				__SCREAMING_SNAKE_CASE							:

					def __init__(				self ,       __lowercase					):







						'''simple docstring'''




						lowerCamelCase_							:		Optional[int]							   =							data
						lowerCamelCase_							:		Union[str, Any]							   =							None


class 				__SCREAMING_SNAKE_CASE							:

					def __init__(				self					):







						'''simple docstring'''




						lowerCamelCase_							:		Tuple							   =							None

					def 	lowercase_							(				self ,       __lowercase					):







						'''simple docstring'''




						lowerCamelCase_							:		int							   =							Node(__lowercase					)
						lowerCamelCase_							:		Optional[int]							   =							self.head
						lowerCamelCase_							:		int							   =							new_node
						return self.head.data





					def 	lowercase_							(				self					):







						'''simple docstring'''




						lowerCamelCase_							:		int							   =							self.head
						lowerCamelCase_							:		Union[str, Any]							   =							self.head
						if self.head:
							while fast_pointer and fast_pointer.next:
								lowerCamelCase_							:		Tuple							   =							fast_pointer.next.next
								lowerCamelCase_							:		Union[str, Any]							   =							slow_pointer.next
							return slow_pointer.data
						else:
							print('No element found.'					)
							return None


if __name__ == "__main__":
							UpperCamelCase__              =						LinkedList()
							for _ in range(int(input().strip())):
														UpperCamelCase__              =						int(input().strip())
														link.push(data)
							print(link.middle_element())


"""simple docstring"""




from functools import lru_cache

@lru_cache
def   UpperCamelCase_  (		SCREAMING_SNAKE_CASE_			):
					if not isinstance(SCREAMING_SNAKE_CASE_,     SCREAMING_SNAKE_CASE_			):
										raise TypeError('k must be an integer.'			)
					if k < 0:
										raise ValueError('k integer must be greater or equal to zero.'			)
					if k == 0:
										return 0
					elif k == 1:
										return 1
					else:
										return fibonacci(k - 1			) + fibonacci(k - 2			)

def   UpperCamelCase_  (		SCREAMING_SNAKE_CASE_,     SCREAMING_SNAKE_CASE_			):
					SCREAMING_SNAKE_CASE				=	len(SCREAMING_SNAKE_CASE_			)
					# Find m such that F_m >= n where F_i is the i_th fibonacci number.
					SCREAMING_SNAKE_CASE				=	0
					while True:
										if fibonacci(SCREAMING_SNAKE_CASE_			) >= len_list:
															SCREAMING_SNAKE_CASE				=	i
															break
										i += 1
					SCREAMING_SNAKE_CASE				=	0
					while fibb_k > 0:
										SCREAMING_SNAKE_CASE				=	min(
										    offset + fibonacci(fibb_k - 1			),     len_list - 1			)  # Prevent out of range
										SCREAMING_SNAKE_CASE				=	arr[index_k]
										if item_k_1 == val:
															return index_k
										elif val < item_k_1:
															fibb_k -= 1
										elif val > item_k_1:
															offset += fibonacci(fibb_k - 1			)
															fibb_k -= 2
					else:
										return -1


if __name__ == "__main__":
	import doctest

	doctest.testmod()
