import math
 
def prime_number_generator(max_num):
    is_prime = [True] * max_num
 
    for i in range(2, int(math.sqrt(max_num))):
        num = i**2
        while num < max_num:
            is_prime[num] = False
            num += i
 
    for index, value in enumerate(is_prime[2:]):
        if value:
            yield index + 2
 
 
def concatenate(max_num):
    return "".join(str(i) for i in prime_number_generator(max_num))
 
input_data = concatenate(25000)
 
def solution(n):
    id = input_data[n:(n+5)]
    return id
 
 
print(solution(0))

aW1wb3J0IG1hdGgKCmRlZiBwcmltZV9udW1iZXJfZ2VuZXJhdG9yKG1heF9udW0pOgogICAgaXNfcHJpbWUgPSBbVHJ1ZV0gKiBtYXhfbnVtCgogICAgZm9yIGkgaW4gcmFuZ2UoMiwgaW50KG1hdGguc3FydChtYXhfbnVtKSkpOgogICAgICAgIG51bSA9IGkqKjIKICAgICAgICB3aGlsZSBudW0gPCBtYXhfbnVtOgogICAgICAgICAgICBpc19wcmltZVtudW1dID0gRmFsc2UKICAgICAgICAgICAgbnVtICs9IGkKCiAgICBmb3IgaW5kZXgsIHZhbHVlIGluIGVudW1lcmF0ZShpc19wcmltZVsyOl0pOgogICAgICAgIGlmIHZhbHVlOgogICAgICAgICAgICB5aWVsZCBpbmRleCArIDIKCgpkZWYgY29uY2F0ZW5hdGUobWF4X251bSk6CiAgICByZXR1cm4gIiIuam9pbihzdHIoaSkgZm9yIGkgaW4gcHJpbWVfbnVtYmVyX2dlbmVyYXRvcihtYXhfbnVtKSkKCmlucHV0X2RhdGEgPSBjb25jYXRlbmF0ZSgyNTAwMCkKCmRlZiBzb2x1dGlvbihuKToKICAgIGlkID0gaW5wdXRfZGF0YVtuOihuKzUpXQogICAgcmV0dXJuIGlkCgoKcHJpbnQoc29sdXRpb24oMCkp