def get_primes(n):
    primes = []
    min_div = [0] * n
    for q in xrange(2, n):
        if min_div[q] == 0:
            primes.append(q)
            min_div[q] = q
        for p in primes:
            if p > min_div[q] or p * q >= n:
                break
            assert min_div[p * q] == 0 
            min_div[p * q] = p
    return primes
 
def find_twins(primes):
    for i in xrange(1, len(primes)):
        if primes[i] - primes[i - 1] == 2:
            yield (primes[i - 1], primes[i])
 
print list(find_twins(get_primes(200)))

CmRlZiBnZXRfcHJpbWVzKG4pOgogICAgcHJpbWVzID0gW10KICAgIG1pbl9kaXYgPSBbMF0gKiBuCiAgICBmb3IgcSBpbiB4cmFuZ2UoMiwgbik6CiAgICAgICAgaWYgbWluX2RpdltxXSA9PSAwOgogICAgICAgICAgICBwcmltZXMuYXBwZW5kKHEpCiAgICAgICAgICAgIG1pbl9kaXZbcV0gPSBxCiAgICAgICAgZm9yIHAgaW4gcHJpbWVzOgogICAgICAgICAgICBpZiBwID4gbWluX2RpdltxXSBvciBwICogcSA+PSBuOgogICAgICAgICAgICAgICAgYnJlYWsKICAgICAgICAgICAgYXNzZXJ0IG1pbl9kaXZbcCAqIHFdID09IDAgCiAgICAgICAgICAgIG1pbl9kaXZbcCAqIHFdID0gcAogICAgcmV0dXJuIHByaW1lcwoKZGVmIGZpbmRfdHdpbnMocHJpbWVzKToKICAgIGZvciBpIGluIHhyYW5nZSgxLCBsZW4ocHJpbWVzKSk6CiAgICAgICAgaWYgcHJpbWVzW2ldIC0gcHJpbWVzW2kgLSAxXSA9PSAyOgogICAgICAgICAgICB5aWVsZCAocHJpbWVzW2kgLSAxXSwgcHJpbWVzW2ldKQoKcHJpbnQgbGlzdChmaW5kX3R3aW5zKGdldF9wcmltZXMoMjAwKSkp