Euler 47- modified sieve method in python

gistfile1.txt

# set up 2 sieves- one is erastosthenes, the other is to track count
n=200000
myPrimes = [True]*(n+1)
myCount = [0]*(n+1)

# sieve, but count each time each composite number is hit during sieve 
for i in range (2,n):
	if myPrimes[i] == True:
		j = 2*i
		while j<=n:
			myPrimes[j]=False
			myCount[j]+=1
			j=j+i

# count up runs of numbers with 4 factors- when you get to 4, stop 
count = 0
for k in range (2,len(myCount)-1):
	if myCount[k]==4:
		count += 1
	else:
		count = 0
	if count == 4:
		print "answer is %r" % (k-3)
		break 

# let's track the count in eratosthenes' sieve
n=200000
myPrimes = [0]*(n+1)

# sieve, but count each time each composite number is hit during sieve 
for i in range (2,n):
    if myPrimes[i] == 0:
        j = 2*i
        while j<=n:
            myPrimes[j] += 1
            j=j+i

# count up runs of numbers with 4 factors- when you get to 4, stop 
count = 0

while not count == 4:
    if myPrimes[n]==4:
        count += 1
        n -= 1
    else:
        count = 0
        n -= 1

print "answer is %r" % (n+1)