e: 1
c: 9327565722767258308650643213344542404592011161659991421
n: 245841236512478852752909734912575581815967630033049838269083
RSA Intro here
c = (m^e)%n
e = 1 -> c = m%n -> m = k*n + c, where k>=0 is an integer
Starting from k=0, try to check which m gives a flag-like output. Luckily, here m = c works.
echo "obase=16; ibase=10; 9327565722767258308650643213344542404592011161659991421" | bc | xxd -r -p