





def  __UpperCAmelCase(   lowercase_   ):
       _lowerCamelCase				:  List[Any]						=		1
       for i in range(1			,     num + 1   ):
              fact *= i
       return fact




def  __UpperCAmelCase(   lowercase_   ):
       _lowerCamelCase				:  Optional[Any]						=		0
       while number > 0:
              _lowerCamelCase				:  List[Any]						=		number % 10
              sum_of_digits += last_digit
              _lowerCamelCase				:  Dict						=		number // 10  # Removing the last_digit from the given number
       return sum_of_digits




def  __UpperCAmelCase(   lowercase_ = 1_00   ):
       _lowerCamelCase				:  int						=		factorial(lowercase_   )
       _lowerCamelCase				:  Optional[Any]						=		split_and_add(lowercase_   )
       return result


if __name__ == "__main__":
       print(solution(int(input('Enter the Number: ').strip())))








import doctest
from collections import deque

import numpy as np







class       __A							:




      """simple docstring"""







      def __init__(		self):



             """simple docstring"""





             _lowerCamelCase				:  Any						=		[2, 1, 2, -1]
             _lowerCamelCase				:  Optional[int]						=		[1, 2, 3, 4]



      def 					__snake_case      (		self):



             """simple docstring"""





             _lowerCamelCase				:  Optional[int]						=		len(self.first_signal)
             _lowerCamelCase				:  str						=		len(self.second_signal)

             _lowerCamelCase				:  str						=		max(a__   ,				a__)

             # create a zero matrix of max_length x max_length
             _lowerCamelCase				:  Optional[Any]						=		[[0] * max_length for i in range(a__)]

             # fills the smaller signal with zeros to make both signals of same length
             if length_first_signal < length_second_signal:
                    self.first_signal += [0] * (max_length - length_first_signal)
             elif length_first_signal > length_second_signal:
                    self.second_signal += [0] * (max_length - length_second_signal)
             for i in range(a__):
                    _lowerCamelCase				:  Optional[Any]						=		deque(self.second_signal)
                    rotated_signal.rotate(a__)
                    for j, item in enumerate(a__):
                           matrix[i][j] += item

        # multiply the matrix with the first signal
             _lowerCamelCase				:  List[Any]						=		np.matmul(np.transpose(a__)   ,				np.transpose(self.first_signal))

             # rounding-off to two decimal places
             return [round(a__   ,				2) for i in final_signal]


if __name__ == "__main__":
       doctest.testmod()

