def prime_number_generator():
    
    yield 2
    
    prime = 3
    
    while True:
        is_prime = True
            
        for i in xrange(3, prime/2, 2):
            if prime % i == 0:
                is_prime = False
                break
                
        if is_prime == True:
            yield prime
            
        prime = prime + 2
        
g = prime_number_generator()
    
i = 0;

while True:
    i += 1
    prime = g.next()
    
    print i, prime
    
    if i > 10001:
        break