#!/usr/bin/env python3
import math

N = 34290741416599402000364426406985307108788847346139849276056423456850484785031054576175547387593396760716456841067680666550537736929030835788005715533
e = 65537
C = 6306633972929323441109245980962040907076223927772663682932361844805694754336072683925275888222658229758199381118184386449967084124219498140114920047

a = math.isqrt(N)
if a * a < N:
    a += 1

while True:
    b2 = a * a - N
    b = math.isqrt(b2)
    if b * b == b2:
        p = a + b
        q = a - b
        break
    a += 1

phi = (p - 1) * (q - 1)
d = pow(e, -1, phi)
m = pow(C, d, N)
print(m.to_bytes((m.bit_length() + 7) // 8, "big").decode())