


'''simple docstring'''






import doctest
from collections import deque

import numpy as np




class 						a__							:





							'''simple docstring'''






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







							def     __SCREAMING_SNAKE_CASE				(						self  )			->				list[float]:
														lowerCAmelCase__			  =      len(self.first_signal  )
														lowerCAmelCase__			  =      len(self.second_signal  )

														lowerCAmelCase__			  =      max(lowerCamelCase_   ,       lowerCamelCase_  )

														# create a zero matrix of max_length x max_length
														lowerCAmelCase__			  =      [[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_  ):
																					lowerCAmelCase__			  =      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
														lowerCAmelCase__			  =      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()





SCREAMING_SNAKE_CASE:     Optional[int]									= {str(digit): digit**5 for digit in range(1_0)}


def 					_a							(					lowerCAmelCase )->	int:
		return sum(DIGITS_FIFTH_POWER[digit] for digit in str(lowerCAmelCase ) )


def 					_a							(					)->	int:
		return sum(
		    number
		    for number in range(1000    ,						1000000 )
		    if number == digits_fifth_powers_sum(lowerCAmelCase ) )


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