Markov Chain generated by iterations of functions

Question

$X_n$ is a Markov Chain on (..,-2, -1, 0, 1,..) obtained by random iterations with functions $f_1(x)=x+2$, $f_2(x)=x−1$, $f_3(x)=0$. In each iteration step we choose function to iterate with equal probabilities. The MC can thus be represented as $X_{n+1}=f_{I_{n+1}}(X_n)$ where $I_n$ is a sequence of independent random variables $P(I_n=1)=P(I_n=2)=P(I_n=3)=1/3$ for each fixed $n$. If $X_0=0$, how can I determine the realisations of $X1$, $X2$, $X7$ corresponding to the realisations $i_1=1$, $i_2=1$,..., $i_6=3$, $i_7=2$ of $I_1$, $I_2$,..., $I_6$, $I_7$?