



"""simple docstring"""
from __future__ import annotations
class 							lowerCamelCase    :






					'''simple docstring'''





					def __init__(			self:				List[Any]		,	snake_case:				int		)  ->      None:
											snake_case_					:str		=     data
											snake_case_					:Tuple		=     None

class 							lowerCamelCase    :






					'''simple docstring'''





					def __init__(			self:				Tuple		)  ->      Any:
											snake_case_					:Optional[Any]		=     None






					def   lowerCAmelCase_							(			self:				Optional[Any]		,	snake_case:				int		)  ->      int:
											snake_case_					:Any		=     Node(snake_case		)
											snake_case_					:int		=     self.head
											snake_case_					:Tuple		=     new_node
											return self.head.data






					def   lowerCAmelCase_							(			self:				int		)  ->      int | None:
											snake_case_					:int		=     self.head
											snake_case_					:Optional[Any]		=     self.head
											if self.head:
																	while fast_pointer and fast_pointer.next:
																							snake_case_					:str		=     fast_pointer.next.next
																							snake_case_					:Optional[int]		=     slow_pointer.next
																	return slow_pointer.data
											else:
																	print("""No element found."""		)
																	return None


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





"""simple docstring"""
def   A_    (     _lowercase,   _lowercase,   _lowercase,   _lowercase      ):







						'''simple docstring'''


						snake_case_					:Dict		=     int((lower_bound + upper_bound) // 2      )
						if array[r] == value:
												return r
						if lower_bound >= upper_bound:
												return -1
						if array[r] < value:
												return binary_search(_lowercase,   r + 1,   _lowercase,   _lowercase      )
						else:
												return binary_search(_lowercase,   _lowercase,   r - 1,   _lowercase      )
def   A_    (     _lowercase,   _lowercase      ):







						'''simple docstring'''


						snake_case_					:Any		=     0
						if matrix[index][0] == value:
												return [index, 0]
						while index < len(_lowercase      ) and matrix[index][0] < value:
												snake_case_					:List[str]		=     binary_search(matrix[index],   0,   len(matrix[index]      ) - 1,   _lowercase      )
												if r != -1:
																		return [index, r]
												index += 1
						return [-1, -1]


if __name__ == "__main__":
						import doctest

						doctest.testmod()
