The Chinese Remainder Theorem · Challenge problem

Find the smallest positive integer $n$ with $n \equiv 1 \pmod 3$ and $2^n \equiv n \pmod 5$.