#!/usr/bin/env python3
def mod(a,b):
    return a-(a//b)*b
def e(a,b):
    u=min(a,b)
    v=max(a,b)
    return mod(sum([97,53*u,71*v,11*u*v,17*u*u,13*v*v]),997)
def pc(x):
    c=0
    for p in range(6):
        if mod(x//(2**p),2)>0:
            c=sum([c,1])
    return c
def js(k):
    a=[]
    for j in range(6):
        if mod(k//(2**j),2)>0:
            a.append(j)
    return a
def minbit(t):
    m=0
    while mod(t//(2**m),2)==0:
        m=sum([m,1])
    return m
n0=[173,233,331,467,641,853]
s0=[211,271,377,529,727,971]
g0=[307,367,489,673,919,1227]
N=[0]*64
C=[0]*64
P=[0]*64
N[2]=173
C[2]=211
P[2]=1
N[3]=233
C[3]=271
P[3]=2
N[5]=331
C[5]=377
P[5]=3
N[9]=467
C[9]=529
P[9]=4
N[17]=641
C[17]=727
P[17]=5
N[33]=853
C[33]=971
P[33]=6
Z=431
def run(k):
    global kk,sz,bestB,bestA,bestH,bestJ,bestT,Z
    kk=k
    sz=pc(k)
    bestB=1000000000
    bestA=0
    bestH=99
    bestJ=99
    bestT=0
    for j in js(k):
        T=kk-(2**j)
        m=minbit(T)
        A=mod(sum([N[T 1]*n0[j 1],e(m,j),7*pc(T),3*j]),997)
        Bh=mod(sum([C[T 1],s0[j 1],N[T 1],2*n0[j 1],3*A,e(m,j)]),9973)
        Bm=mod(sum([C[T 1],g0[j 1],2*N[T 1],n0[j 1],5*A,2*e(m,j)]),9973)
        Z=mod(sum([37*Z,11*A,13*Bh,19*sz,23*sum([j,1]),29]),9973)
        better=(Bh<bestB) or (Bh==bestB and 1<bestH) or (Bh==bestB and 1==bestH and j<bestJ)
        if better:
            bestB=Bh
            bestA=A
            bestH=1
            bestJ=j
            bestT=T
        Z=mod(sum([37*Z,11*A,13*Bm,19*sz,23*sum([j,1]),58]),9973)
        better=(Bm<bestB) or (Bm==bestB and 2<bestH) or (Bm==bestB and 2==bestH and j<bestJ)
        if better:
            bestB=Bm
            bestA=A
            bestH=2
            bestJ=j
            bestT=T
    N[k 1]=bestA
    C[k 1]=bestB
    P[k 1]=mod(sum([31*P[bestT 1],17*sum([bestJ,1]),bestH]),9973)
for k in [3,5,6,9,10,12,17,18,20,24,33,34,36,40,48]:
    run(k)
for k in [7,11,13,14,19,21,22,25,26,28,35,37,38,41,42,44,49,50,52,56]:
    run(k)
for k in [15,23,27,29,30,39,43,45,46,51,53,54,57,58,60]:
    run(k)
for k in [31,47,55,59,61,62]:
    run(k)
for k in [63]:
    run(k)
print(C[64],P[64],Z)