# RSA Challenge Parameters
# Solve: find m such that m^e ≡ c (mod n)
# Hint: m is short enough that m^e < n (no modular reduction occurs)

e = 3

n = 128965250280184027092386384322048503574340370982023398152884502476870851410526112155772727140116752887211506923285126867194460402093373470516916054771545046635638974148026911466614789584160716984399178969770017795155348937609779620256722043568584135488639036056883001461647411101393464719576098853175389375971

c = 27986825396876738744524608081040018954214410934540191887864004531326614438779945835193406029612633050950728961355285681333547144324813586432006903646381282111980716853640663773732926506789272394006582093223066196577792689620408211520830410462821