





def 		A_				(     _lowerCAmelCase							,   _lowerCAmelCase     )						-> str:

 if not (isinstance(_lowerCAmelCase							,   _lowerCAmelCase     ) and isinstance(_lowerCAmelCase							,   _lowerCAmelCase     )):
  raise ValueError("longest_common_substring() takes two strings for inputs"     )

 UpperCamelCase	:					str       	=   len(_lowerCAmelCase     )
 UpperCamelCase	:					Union[str, Any]       	=   len(_lowerCAmelCase     )

 UpperCamelCase	:					Any       	=   [[0] * (texta_length + 1) for _ in range(texta_length + 1     )]
 UpperCamelCase	:					Optional[Any]       	=   0
 UpperCamelCase	:					List[Any]       	=   0

 for i in range(1							,   texta_length + 1     ):
  for j in range(1							,   texta_length + 1     ):
   if texta[i - 1] == texta[j - 1]:
    UpperCamelCase	:					Optional[int]       	=   1 + dp[i - 1][j - 1]
    if dp[i][j] > ans_length:
     UpperCamelCase	:					Optional[Any]       	=   i
     UpperCamelCase	:					Optional[int]       	=   dp[i][j]

 return texta[ans_index - ans_length : ans_index]


if __name__ == "__main__":
    import doctest

    doctest.testmod()






def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       int = 10_00     ):


      '''simple docstring'''



      lowerCamelCase_		     =    2**power
      lowerCamelCase_		     =    0
      while n:
            lowerCamelCase_     ,				lowerCamelCase_		     =    r + n % 10, n // 10
      return r


if __name__ == "__main__":
 print(solution(int(str(input()).strip())))



