while (possiblePrime <= x): # for personal preference changed range to raw_input, so that the range can be arbitrary, though at a certain point a large range will consume a-lot of memory
divisor = 2
isPrime = True

possiblePrime = possiblePrime + 2
while (primeList==primeList):
y= int(raw_input("To see if a number is in the list enter that number enter -1 to exit: "))
if y== -1:
print "Goodbye"
break
if y in primeList:
print y, "Is in the list"
if y not in primeList:
print y, "Is not in the list"