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






def 				UpperCAmelCase_						(				__SCREAMING_SNAKE_CASE = 100_0000				):
	lowercase	    =       limit - 1
	if divisor % 2 == 0:
		divisor += 1
	while least_divisible_repunit(__SCREAMING_SNAKE_CASE				) <= limit:
		divisor += 2
	return divisor


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





from __future__ import annotations

import numpy as np
def 							UpperCamelCase_(					_A :list[float]	)->		Optional[Any]:
			return np.maximum(0					,  _A	)


if __name__ == "__main__":
						print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]


