t=[0,0,32,26,444,1628,5906,80,126960,380882,2097152]
d=[0,0,126,126,1778,6510,23622,510,507842,1523526,8388606]
z=10**11
r=0
for n in range(2,11):
m,k=z/t[n],z%t[n]
if k<=n+4:
k+=t[n]
m-=1
v=4*n+4
u=[0,2]+[2*(n+i)-3 for i in range(2,n+4)]+[v]+[v+1,v+3]
s=set(u)
j=2
while len(u) < k+1:
if u[-1]+2-v not in s:
s.add(u[-1]+2)
u.append(u[-1]+2)
else:
while u[j]+v < u[-1] or j==n+4 or u[j]+v-2 in s:
j+=1
s.add(u[j]+v)
u.append(u[j]+v)
j+=1
r+=m*d[n]+u[-1]
print n,r
print r