Euler #179

def factorize(n):
    factors = []
    for x in range(1, int(n**0.5)+1):
        if n % x == 0:
            factors.extend((x, int(n/x)))
    return len(set(factors))

answer = 0
for x in range(2, 10**7):
    print(x)
    if factorize(x) == factorize(x+1):
        answer += 1
print(answer)