u/CustomerOwn4578

RSA can be generalized with more than two prime factors:

n = p · q · r · s

In this case:

φ(n) = (p − 1) · (q − 1) · (r − 1) · (s − 1)

You intercept:

n = 809813663077840703957757699767304217126031944338487414656023884862792610444562629667450812100198190924984878537242055718763406025909208698113518074799

e = 65537

c = 2418537753186663825805516058018841356307644071330558039531508065970851794169418804903618367199472223698033438178158597268891166958578016330782825328224670

The prime factors of n are:

p = 63467821393644113698105291007444590497

q = 91202660656443863725201651212119257029

r = 60133006589355803056238092925770203727

s = 14566636912063189062901168341676588161

Decrypt the message.

Flag format: crypto{...}