divisibility - Solving system of congruences using CRT

$$4x \equiv 5 \pmod 7$$ $$7x \equiv 4 \pmod {15}$$

I need to solve this system of congruences using Chinese Reminder Theorem. It would be easy to use CRT if not those 4 and 7 near the x variables. How can I do this? Just divide both congruences by 4/7 and use CRT in something like:

$$x \equiv \frac54 \pmod 7$$ $$x \equiv \frac47 \pmod {15}$$

? It gives me $\frac{283}4 + 105k$ as the result.