这是一道CTF密码题，提示中国剩余定理，请给出解题脚本

from Crypto.Util.number import *

不告诉你

flag = b'flag{xxxxxxxxxxxxxxxx}'
assert len(flag) == 22

def getMyPrime(e):
while True:
mp = getPrime(128)
if (mp - 1) % e ** 2 == 0:
return mp

e = 23
p = getMyPrime(e)
q = getMyPrime(e)
c = pow(bytes_to_long(flag), e, p * q)

print(f"e = {e}")
print(f"n = {p * q}")
print(f"c = {c}")

"""
e = 23
n = 68845152829058116658841043293475262386887281057580308474437645119484930775881
c = 15523098599855471079087688924040518688956265214912059289407545281187711130018
"""