from Crypto.Util.number import long_to_bytes,bytes_to_long
key = b'New_Star_CTF'
key_b = bytes_to_long(key)
c = 8091799978721254458294926060841
m = c ^ key_b
m = long_to_bytes(m)
print(m)
from Crypto.Util.number import *
n = 52147017298260357180329101776864095134806848020663558064141648200366079331962132411967917697877875277103045755972006084078559453777291403087575061382674872573336431876500128247133861957730154418461680506403680189755399752882558438393107151815794295272358955300914752523377417192504702798450787430403387076153
p = 7221289171488727827673517139597844534869368289455419695964957239047692699919030405800116133805855968123601433247022090070114331842771417566928809956044421
q = 7221289171488727827673517139597844534869368289455419695964957239047692699919030405800116133805855968123601433247022090070114331842771417566928809956045093
e = 65537
c = 48757373363225981717076130816529380470563968650367175499612268073517990636849798038662283440350470812898424299904371831068541394247432423751879457624606194334196130444478878533092854342610288522236409554286954091860638388043037601371807379269588474814290382239910358697485110591812060488786552463208464541069
d = inverse(e,(p-1)*(q-1))
m = pow(c,d,n)
print(m)
print(hex(m))
alpha1 = 'abcdefghijklmnopqrstuvwxyz'
alpha2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
c = 'ksjr{EcxvpdErSvcDgdgEzxqjql}'
ans = ''
n = 5
for i in c:
if i in alpha1:
ans += alpha1[(alpha1.find(i)-n)%26]
elif i in alpha2:
ans += alpha2[(alpha2.find(i)-n)%26]
else:
ans += i
n += 2
print(ans)