The Chinese Remainder Theorem · Easy problem

The CRT formula for moduli $3$ and $5$ uses the number $e$ with $0 \le e < 15$ such that $e \equiv 1 \pmod 3$ and $e \equiv 0 \pmod 5$. Find $e$.