#rtactf
from Crypto.Util.number import getPrime, isPrime
import os
def getSexyPrime(n=512):
while True:
p = getPrime(n)
if isPrime(p+6):
return p, p+6
if __name__ == '__main__':
m = int.from_bytes(os.getenv("FLAG", "FAKE{sample_flag}").encode(), 'big')
p, q = getSexyPrime()
n = p * q
e = 65537
c = pow(m, e, n)
print(f"n = 0x{n:x}")
print(f"e = 0x{e:x}")
print(f"c = 0x{c:x}")
#RSA
with open("output.txt") as f:
n = int(f.readline().strip().split(" = ")[1], 16)
e = int(f.readline().strip().split(" = ")[1], 16)
c = int(f.readline().strip().split(" = ")[1], 16)
PR.<x> = ZZ[]
f = x*(x + 6) - n
p = int(f.roots()[0][0])
q = n // p
d = int(pow(e, -1, (p-1)*(q-1)))
m = pow(c, d, n)
print(bytes.fromhex(hex(int(m))[2:]))