Find the smallest integer $n > 1$ such that $n \equiv 1 \pmod 2$, $n \equiv 2 \pmod 3$, $n \equiv 3 \pmod 4$.