A modular invariant warmup

Problem

Start with the number $1$. You may repeatedly apply either of the following operations:

• replace $n$ by $n + 3$, or
• replace $n$ by $2n$.

Is it possible to reach $5$?