已知 n，e ,d 分解 p，q

e = 3683191938452247871641914583009119792552938079110383367782698429399084083048335018186915282465581498846777124014232879019914546010406868697694661244001972931366227108140590201194336470785929194895915077935083045957890179080332615291089360169761324533970721460473221959270664692795701362942487885620152952927112838769014944652059440137350285198702402612151501564899791870051001152984815689187374906618917967106000628810361686645504356294175173529719443860140795170776862320812544438211122891112138748710073230404456268507750721647637959502454394140328030018450883598342764577147457231373121223878829298942493059211583

n = 24493816160588971749455534346389861269947121809901305744877671102517333076424951483888863597563544011725032585417200878377314372325231470164799594965293350352923195632229495874587039720317200655351788887974047948082357232348155828924230567816817425104960545706688263839042183224681231800805037117758927837949941052360649778743187012198508745207332696876463490071925421229447425456903529626946628855874075846839745388326224970202749994059533831664092151570836853681204646481502222112116971464211748086292930029540995987019610460396057955900244074999111267618452967579699626655472948383601391620012180211885979095636919

d = 1779217788383673416690068487595062922771414230914791138743960472798057054853883175313487137767631446949382388070798609545617543049566741624609996040273727

from gmpy2 import gcd

from random import *


def factor_n_with_ed(n,e,d):  

    p = 1  

    q = 1  

    while p==1 and q==1:  

        k = d * e - 1  

        g = -randint(0,n)

        while p==1 and q==1 and k % 2 == 0:  

            k //= 2  

            y = pow(g,k,n)  

            if y!=1 and gcd(y-1,n)>1:  

                p = gcd(y-1,n)  

                q = n//p  

    return p,q

print(factor_n_with_ed(n,e,d))