





'''simple docstring'''





import mpmath  # for roots of unity
import numpy as np







class 			__A       :




      """simple docstring"""







      def __init__(		self      ,							a__=None      ,							a__=None):



             """simple docstring"""





             _lowerCamelCase							:     Any	=		list(poly_a or [0])[:]
             _lowerCamelCase							:     List[str]	=		list(poly_b or [0])[:]

             # Remove leading zero coefficients
             while self.polyA[-1] == 0:
                    self.polyA.pop()
             _lowerCamelCase							:     Dict	=		len(self.polyA)

             while self.polyB[-1] == 0:
                    self.polyB.pop()
             _lowerCamelCase							:     Dict	=		len(self.polyB)

             # Add 0 to make lengths equal a power of 2
             _lowerCamelCase							:     Optional[Any]	=		int(
                 2 ** np.ceil(np.loga(len(self.polyA) + len(self.polyB) - 1)))

             while len(self.polyA) < self.c_max_length:
                    self.polyA.append(0)
             while len(self.polyB) < self.c_max_length:
                    self.polyB.append(0)
             # A complex root used for the fourier transform
             _lowerCamelCase							:     List[Any]	=		complex(mpmath.root(x=1      ,							n=self.c_max_length      ,							k=1))

             # The product
             _lowerCamelCase							:     int	=		self.__multiply()


      def 				__snake_case			(		self      ,							a__):



             """simple docstring"""





             _lowerCamelCase							:     Optional[int]	=		[[x] for x in self.polyA] if which == '''A''' else [[x] for x in self.polyB]
             # Corner case
             if len(a__) <= 1:
                    return dft[0]
             #
             _lowerCamelCase							:     int	=		self.c_max_length // 2
             while next_ncol > 0:
                    _lowerCamelCase							:     int	=		[[] for i in range(a__)]
                    _lowerCamelCase							:     str	=		self.root**next_ncol

                    # First half of next step
                    _lowerCamelCase							:     Union[str, Any]	=		1
                    for j in range(self.c_max_length // (next_ncol * 2)):
                           for i in range(a__):
                                  new_dft[i].append(dft[i][j] + current_root * dft[i + next_ncol][j])
                           current_root *= root
                    # Second half of next step
                    _lowerCamelCase							:     Union[str, Any]	=		1
                    for j in range(self.c_max_length // (next_ncol * 2)):
                           for i in range(a__):
                                  new_dft[i].append(dft[i][j] - current_root * dft[i + next_ncol][j])
                           current_root *= root
                    # Update
                    _lowerCamelCase							:     Optional[Any]	=		new_dft
                    _lowerCamelCase							:     int	=		next_ncol // 2
             return dft[0]


      def 				__snake_case			(		self):



             """simple docstring"""





             _lowerCamelCase							:     Dict	=		self.__dft('''A''')
             _lowerCamelCase							:     List[Any]	=		self.__dft('''B''')
             _lowerCamelCase							:     str	=		[[dft_a[i] * dft_b[i] for i in range(self.c_max_length)]]
             del dft_a
             del dft_b

             # Corner Case
             if len(inverce_c[0]) <= 1:
                    return inverce_c[0]
             # Inverse DFT
             _lowerCamelCase							:     Optional[Any]	=		2
             while next_ncol <= self.c_max_length:
                    _lowerCamelCase							:     Any	=		[[] for i in range(a__)]
                    _lowerCamelCase							:     Dict	=		self.root ** (next_ncol // 2)
                    _lowerCamelCase							:     Optional[Any]	=		1
                    # First half of next step
                    for j in range(self.c_max_length // next_ncol):
                           for i in range(next_ncol // 2):
                                  # Even positions
                                  new_inverse_c[i].append(
                                      (
                                          inverce_c[i][j]
                                          + inverce_c[i][j + self.c_max_length // next_ncol]
                                      )
                                      / 2)
                                  # Odd positions
                                  new_inverse_c[i + next_ncol // 2].append(
                                      (
                                          inverce_c[i][j]
                                          - inverce_c[i][j + self.c_max_length // next_ncol]
                                      )
                                      / (2 * current_root))
                           current_root *= root
                    # Update
                    _lowerCamelCase							:     Any	=		new_inverse_c
                    next_ncol *= 2
             # Unpack
             _lowerCamelCase							:     List[str]	=		[round(x[0].real      ,							8) + round(x[0].imag      ,							8) * 1j for x in inverce_c]

             # Remove leading 0's
             while inverce_c[-1] == 0:
                    inverce_c.pop()
             return inverce_c



      def __str__(		self):



             """simple docstring"""





             _lowerCamelCase							:     List[str]	=		'''A = ''' + ''' + '''.join(
                 F"""{coef}*x^{i}""" for coef, i in enumerate(self.polyA[: self.len_A]))
             _lowerCamelCase							:     Any	=		'''B = ''' + ''' + '''.join(
                 F"""{coef}*x^{i}""" for coef, i in enumerate(self.polyB[: self.len_B]))
             _lowerCamelCase							:     Any	=		'''A*B = ''' + ''' + '''.join(
                 F"""{coef}*x^{i}""" for coef, i in enumerate(self.product))

             return F"""{a}\n{b}\n{c}"""


# Unit tests
if __name__ == "__main__":
       import doctest

       doctest.testmod()








def    __UpperCAmelCase(      lowercase_ = 10_00      ):
       _lowerCamelCase							:     Optional[int]	=		2**power
       _lowerCamelCase							:     Optional[int]	=		0
       while n:
              _lowerCamelCase,  _lowerCamelCase							:     Optional[Any]	=		r + n % 10, n // 10
       return r


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

