def eratosthenes(n):
    is_prime = ([False, True] * (n//2+1))[0: n+1]
    is_prime[1] = False
    is_prime[2] = True
    for i in range(3, n+1, 2):
        if not(is_prime[i]):
            continue
        if i*i > n:
            break
        for k in range(i*i, n+1, i):
            is_prime[k] = False
    return is_prime

is_prime = eratosthenes(10**14)
twin_prime = []
for i in range(5, 10**14):
    if is_prime[i-2] and is_prime[i]:
        twin_prime.append(i)