
"""simple docstring"""




import doctest
from collections import deque

import numpy as np





class 			snake_case  :

							def __init__(self     ):

									"""simple docstring"""







									SCREAMING_SNAKE_CASE_    			=			[2, 1, 2, -1]
									SCREAMING_SNAKE_CASE_    			=			[1, 2, 3, 4]







							def _lowercase       (self     ):

									"""simple docstring"""







									SCREAMING_SNAKE_CASE_    			=			len(self.first_signal     )
									SCREAMING_SNAKE_CASE_    			=			len(self.second_signal     )

									SCREAMING_SNAKE_CASE_    			=			max(SCREAMING_SNAKE_CASE_							,							SCREAMING_SNAKE_CASE_     )

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

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

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

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


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

"""simple docstring"""




from __future__ import annotations

import math



def 							_lowerCamelCase			(			__a     ):

		if num <= 0:
				SCREAMING_SNAKE_CASE_    			=			F'{num}: Invalid input, please enter a positive integer.'
				raise ValueError(__a     )

		SCREAMING_SNAKE_CASE_    			=			[True] * (num + 1)
		SCREAMING_SNAKE_CASE_    			=			[]
		SCREAMING_SNAKE_CASE_    			=			2
		SCREAMING_SNAKE_CASE_    			=			int(math.sqrt(__a     )     )

		while start <= end:
				# If start is a prime
				if sieve[start] is True:
						prime.append(__a     )

						# Set multiples of start be False
						for i in range(start * start,				num + 1,				__a     ):
								if sieve[i] is True:
										SCREAMING_SNAKE_CASE_    			=			False

				start += 1

		for j in range(end + 1,				num + 1     ):
				if sieve[j] is True:
						prime.append(__a     )

		return prime


if __name__ == "__main__":
						print(prime_sieve(int(input('Enter a positive integer: ').strip())))