import libnum
e = 1
c = 9327565722767258308650643213344542404592011161659991421
n = 245841236512478852752909734912575581815967630033049838269083
#print libnum.factorize(n)
q = 590872612825179551336102196593
p = n/q
assert p*q == n
phi_n = (p-1)*(q-1)
d = libnum.invmod(e,phi_n)
print libnum.n2s(pow(c,d,n))