Parity invariant warmup

Problem

A number starts at $1$. You may repeatedly apply one move:

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

Can you ever reach $2$?