The Chinese Remainder Theorem · Easy problem

An integer $N$ satisfies $N \equiv 1 \pmod 3$ and $N \equiv 3 \pmod 4$. Find the remainder when $N$ is divided by $12$.