






"""simple docstring"""


from __future__ import annotations


class    snake_case						:


   '''simple docstring'''

   def __init__(      self					:	Any,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     __A		     =					data
     __A		     =					None





class    snake_case						:


   '''simple docstring'''

   def __init__(      self					:	Optional[Any]    ):

     '''simple docstring'''
     __A		     =					None


   def 							_SCREAMING_SNAKE_CASE							(      self					:	Tuple,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     __A		     =					Node(_lowerCamelCase    )
     __A		     =					self.head
     __A		     =					new_node
     return self.head.data






   def 							_SCREAMING_SNAKE_CASE							(      self					:	str    ):

     '''simple docstring'''
     __A		     =					self.head
     __A		     =					self.head
     if self.head:
       while fast_pointer and fast_pointer.next:
         __A		     =					fast_pointer.next.next
         __A		     =					slow_pointer.next
       return slow_pointer.data
     else:
       print('''No element found.'''    )
       return None


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









"""simple docstring"""







from math import factorial


def  __SCREAMING_SNAKE_CASE (  __UpperCAmelCase   ,				__UpperCAmelCase      ):
		return factorial(__UpperCAmelCase      ) / (factorial(__UpperCAmelCase      ) * factorial(n - r      ))


def  __SCREAMING_SNAKE_CASE (  ):
		_lowercase				: Optional[Any]     =   0

		for i in range(1   ,				101      ):
				for j in range(1   ,				i + 1      ):
						if combinations(__UpperCAmelCase   ,				__UpperCAmelCase      ) > 1E6:
								total += 1
		return total


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



