Markov Chains & Long-Run Behavior · Easy problem

A three-state Markov chain has steady-state distribution $\boldsymbol\pi = \left(\tfrac12, \tfrac13, \tfrac16\right)$ and is irreducible. Starting in state 3, what is the expected number of steps until the chain first returns to state 3?