def is_prime(n):
		hits = 0
		for x in range(2, n):
			for y in range(2, n):
				if x*y == n:
					hits += 1
					if hits > 1:
						return False
		return True
dataset/ETHPy150Open PythonJS/PythonJS/regtests/bench/webworker_single.py/is_prime/original