






"""simple docstring"""






import math



def  __lowerCamelCase					(					lowerCAmelCase__				):
				A__							 =       []
				A__							 =       2
				A__							 =       int(math.sqrt(lowerCAmelCase__				)				)  # Size of every segment
				A__							 =       [True] * (end + 1)
				A__							 =       []

				while start <= end:
								if temp[start] is True:
												in_prime.append(lowerCAmelCase__				)
												for i in range(start * start       ,end + 1       ,lowerCAmelCase__				):
																A__							 =       False
								start += 1
				prime += in_prime

				A__							 =       end + 1
				A__							 =       min(2 * end       ,lowerCAmelCase__				)

				while low <= n:
								A__							 =       [True] * (high - low + 1)
								for each in in_prime:
												A__							 =       math.floor(low / each				) * each
												if t < low:
																t += each

												for j in range(lowerCAmelCase__       ,high + 1       ,lowerCAmelCase__				):
																A__							 =       False

								for j in range(len(lowerCAmelCase__				)				):
												if temp[j] is True:
																prime.append(j + low				)

								A__							 =       high + 1
								A__							 =       min(high + end       ,lowerCAmelCase__				)

				return prime







print(sieve(10**6))










"""simple docstring"""






print((lambda quine: quine % quine)('''print((lambda quine: quine %% quine)(%r))'''))


