Prime number finder V2 (Fix for Python 3)

import time

stop=1000000000
primes=[]
count=0
save=1
toGen=10
range=xrange

def primeGenerator():
    if stop>=2:yield 2
    if stop>2: yield 3
    for i in range(5,stop,2):
        for o in range(3,int(i**0.5+1),2):
            if not i%o:
                break
        else:
            yield i
        continue

print("Use a negative number to use hardcoded defaults")
stop=input("What number to stop at? (Default: 1 000 000 000):")
tmrs=time.time()
if stop<0:
    stop=1000000000
for p in primeGenerator():
    print("Found a prime: "+str(p)+"; "+time.ctime(time.time()))
    if save:
        primes.append(p)
        if len(primes)==toGen:
            break
    else:
        count+=1
        if count==toGen:
            break
print "Finished! Took %.2f to finish."%(time.time()-tmrs)
if save:print("Total of "+str(len(primes))+" primes found.")
else:print("Total of "+str(count)+" primes found.")
raw_input("Press enter to continue...")