

import doctest
from collections import deque

import numpy as np






class 	UpperCAmelCase__		:






  """simple docstring"""


  def __init__(							self						:		List[Any] )		->							None:
       SCREAMING_SNAKE_CASE__   =   [2, 1, 2, -1]
       SCREAMING_SNAKE_CASE__   =   [1, 2, 3, 4]







  def 				lowercase_		(							self						:		Optional[int] )		->							list[float]:
       SCREAMING_SNAKE_CASE__   =   len(self.first_signal )
       SCREAMING_SNAKE_CASE__   =   len(self.second_signal )

       SCREAMING_SNAKE_CASE__   =   max(__lowerCamelCase     ,       __lowerCamelCase )

       # create a zero matrix of max_length x max_length
       SCREAMING_SNAKE_CASE__   =   [[0] * max_length for i in range(__lowerCamelCase )]

       # 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(__lowerCamelCase ):
            SCREAMING_SNAKE_CASE__   =   deque(self.second_signal )
            rotated_signal.rotate(__lowerCamelCase )
            for j, item in enumerate(__lowerCamelCase ):
                 matrix[i][j] += item

        # multiply the matrix with the first signal
       SCREAMING_SNAKE_CASE__   =   np.matmul(np.transpose(__lowerCamelCase )     ,       np.transpose(self.first_signal ) )

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


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





def     UpperCAmelCase_       (						_A    ):





     '''simple docstring'''




     if divisor % 5 == 0 or divisor % 2 == 0:
          return 0
     SCREAMING_SNAKE_CASE__   =   1
     SCREAMING_SNAKE_CASE__   =   1
     while repunit:
          SCREAMING_SNAKE_CASE__   =   (10 * repunit + 1) % divisor
          repunit_index += 1
     return repunit_index
def     UpperCAmelCase_       (						_A = 1_00_00_00    ):





     '''simple docstring'''




     SCREAMING_SNAKE_CASE__   =   limit - 1
     if divisor % 2 == 0:
          divisor += 1
     while least_divisible_repunit(_A    ) <= limit:
          divisor += 2
     return divisor


if __name__ == "__main__":
       print(F"{solution() = }")


