number theory - Write a single congruence?

Write a single congruence that is equivalent to the pair of congruences:

$x\equiv 1(\mod4)$ and $x\equiv 2 (\mod 3)$.

I am new to Number Theory/ Modular Arithmetic. Just started reading the theory from a book yesterday. Earlier I had read about it a little on the internet. I know the basic definitions and some properties. I do not understand the question properly. What does writing a single congruence mean? Does it mean I have to find $x$? How do I solve this question. Do I need to use any theorem like the Chinese Remainder Theorem or something else? I am stuck. Please help.