I have read multiple websites to see what would happen with RSA when $\phi(n)$ and $e$ are not relatively prime, but no one has discussed it.

Can someone explain how to decrypt $c$ if $\phi(n)$ and $e$ aren't relatively prime?