import sympy
def nnp(a,n):
    t=[]
    t.append(a)
    for i in range(n):
        a=sympy.nextprime(a)
        t.append(a)
    return(t)
def diffarr(t):
    a=len(t)
    s=[]
    for i in range(a-1):
        s.append(t[i+1]-t[i])
    return(s)
def iseq(x,y):
    l=len(x)
    c=0
    for i in range(l):
        if x[i]==y[i]:
            c=c+1
    if c==l:
        return(True)
    else:
        return(False)
n=1
p=2
while p>0:
    m1=nnp(p,n)
    m2=nnp(m1[-1],n)
    if iseq(diffarr(m1),diffarr(m2))==True:
        print(m1[0])
        n=n+1
        p=2
    p=sympy.nextprime(p)