import numpy as np
from numba import vectorize, int32, int64, bool_
import time as time_


@vectorize([bool_(int32), bool_(int64)], nopython=True, target='parallel')
def is_prime(n):
    i = 2
    while True:
        if not n % i:
            return False
        i += 1
        if i >= n:
            return True
    return True


def primes_below_p(n):
    l = []
    primes = is_prime(np.arange(n + 1))
    for j in xrange(9, n + 1):
        if primes[j - 6] and primes[j]:
            l.append((j-6, j))
    return l


a = int(round(time_.time() * 1000))
primes = primes_below_p(100 * 1000)
b = int(round(time_.time() * 1000))
print(primes)
print("%s mils" % (b-a))