Rating:
I used the server to get some results and then put them in the script i made.
```
from Crypto.Util.number import *
from math import gcd
# Given values
n1 = 18884595666393269670791356005349900455673266197494672810591464543043951690654942216397547253857736937096441749438748853738552730864111155808664192350867496275008795419775413762820533571461161081389524010448583634403856161263908310783588453913254008735227323498756625403667987721726271188258114818524907924384026458154912252119946261268511246118958056914380413537810040670630996398485728087060835626501729810919368983081212258951918909619240127612222947973467128250745513278786038754278186813725943506409939833407020161180676776155633371902468283743588621747707854246456428924828568026976801405814167036092943946738497
n2 = 16521953429983001456884904007761440440610004253524162373701937155521267082096672454360397516703799778616427686436666367659709544047497955450571958143381872652261392085934472360196660828880756911129821105110157596170999842862618052040404662764843033392589418110403528840241395354535007410888105131356150427789126674522077477385408426010368658079551211854414278379921576334401468540584767792236017739193519005352256979664006450727036706406784334071211431614624303550984878699629447760951174479754434190486421522038091005159127972030779222211733886300892219721523951068004516396127615186847066655449873982811579383197327
e = 65537
c = 14042490112633675740265954461748075791673724645409791301383284661785937652032901899959020433570370536645959251094642294897561906302817999246319789054228106224418960525879392619164084035352048887711206941884042886663177501157473182043733376786816184240481899200254959334937889724765611063205828099559003939845795099553766162620604457954884776436725479660037331959923452443632670778508786817505552305524708656688318371359652098949150850258916787741339852513767078473536432243075568338137362517206492901062779636276411423782602772437218765610842384461178602982208801544434173791888115643498193098852362253902653918281790
# Step 1: Compute gcd of n1 and n2 to find p
p = gcd(n1, n2)
q = n1 // p
r = n2 // p
# Step 2: Compute phi for n2
phi_n2 = (p - 1) * (r - 1)
# Step 3: Compute private exponent d for n2
d = pow(e, -1, phi_n2)
# Step 4: Decrypt the flag
flag_long = pow(c, d, n2)
flag = long_to_bytes(flag_long).decode()
print("Decrypted flag:", flag)
```
Flag: `bcactf{w0w_@lg3br@_d3in48uth934r}`
