



'''simple docstring'''





from __future__ import annotations






class  lowerCamelCase_   :
  """simple docstring"""




  def __init__(			self				:     Union[str, Any]      ,     _a				:     int       ) -> Optional[Any]:
    __lowerCamelCase	:	Any   	=			data
    __lowerCamelCase	:	List[Any]   	=			None






class  lowerCamelCase_   :
  """simple docstring"""




  def __init__(			self				:     Optional[int]       ) -> str:
    __lowerCamelCase	:	Optional[Any]   	=			None




  def 						_lowercase					(			self				:     Optional[int]      ,     _a				:     int       ) -> List[str]:
    __lowerCamelCase	:	Tuple   	=			Node(_A       )
    __lowerCamelCase	:	int   	=			self.head
    __lowerCamelCase	:	Optional[Any]   	=			new_node
    return self.head.data




  def 						_lowercase					(			self				:     Optional[Any]       ) -> int:
    __lowerCamelCase	:	List[Any]   	=			self.head
    __lowerCamelCase	:	List[Any]   	=			self.head
    if self.head:
      while fast_pointer and fast_pointer.next:
        __lowerCamelCase	:	Any   	=			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'''





def 	a_					(							_lowerCAmelCase	,_lowerCAmelCase	)				->				int:
  # The longer word should come first
  if len(_lowerCAmelCase	) < len(_lowerCAmelCase	):
    return levenshtein_distance(_lowerCAmelCase	,_lowerCAmelCase	)

  if len(_lowerCAmelCase	) == 0:
    return len(_lowerCAmelCase	)

  __lowerCamelCase	:	int   	=			list(range(len(_lowerCAmelCase	) + 1	)	)

  for i, ca in enumerate(_lowerCAmelCase	):
    __lowerCamelCase	:	Union[str, Any]   	=			[i + 1]

    for j, ca in enumerate(_lowerCAmelCase	):
      # Calculate insertions, deletions and substitutions
      __lowerCamelCase	:	Any   	=			previous_row[j + 1] + 1
      __lowerCamelCase	:	int   	=			current_row[j] + 1
      __lowerCamelCase	:	Any   	=			previous_row[j] + (ca != ca)

      # Get the minimum to append to the current row
      current_row.append(min(_lowerCAmelCase	,_lowerCAmelCase	,_lowerCAmelCase	)	)

    # Store the previous row
    __lowerCamelCase	:	Optional[int]   	=			current_row

  # Returns the last element (distance)
  return previous_row[-1]


if __name__ == "__main__":
   _UpperCamelCase							    =						input('Enter the first word:\n').strip()
   _UpperCamelCase							    =						input('Enter the second word:\n').strip()

   _UpperCamelCase							    =						levenshtein_distance(first_word, second_word)
   print(f'''Levenshtein distance between {first_word} and {second_word} is {result}''')






