RSA Decryption Challenge with Four Prime Factors

The post presents an RSA decryption challenge where the modulus n is a product of four prime factors (p, q, r, s) instead of the usual two. The given values include n, the public exponent e (65537), the ciphertext c, and the four prime factors of n. The Euler’s totient function φ(n) is defined as the product of each prime factor minus one. The goal is to decrypt the message and provide the flag in the format crypto{...}.