



"""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'''




__snake_case  : str		       =    10**8





def 	_UpperCAmelCase       (				_UpperCamelCase       :      int  )      -> bool:
    if n % 10 == 0:
        return False
    A_      =  str(_UpperCamelCase  )
    return s == s[::-1]





def 	_UpperCAmelCase       (				)      -> int:
    A_      =  set()
    A_      =  1
    A_      =  5
    while sum_squares < LIMIT:
        A_      =  first_square + 1
        while sum_squares < LIMIT:
            if is_palindrome(_UpperCamelCase  ):
                answer.add(_UpperCamelCase  )
            last_square += 1
            sum_squares += last_square**2
        first_square += 1
        A_      =  first_square**2 + (first_square + 1) ** 2

    return sum(_UpperCamelCase  )


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






