Consider the Coin toss problem, i.e. let $Z_{i} : \Omega \rightarrow \{0,1\}$ with $$ Z_{i}\left(\omega\right) = \begin{cases} 1 & \text{if }\omega = H\\ 0 & \text{if } \omega = T \end{cases} $$ be the outcome of the $i$-th coin toss with $\Omega = \{H,T\}$. Assume all the $Z_{i}$ are independent and identical distributed with $$ \mathbb{P}(Z_{i} = 1) = \mathbb{P}(Z_{i} = 0) = \frac{1}{2}. $$ Now define $$ R := \min \{k\geq 1 \mid Z_{k} = 1,Z_{k+1} = 0,Z_{k+2} = 1, Z_{k+3} = 0\}. $$ $R$ is the number of tosses to get the pattern HTHT.
My question ist how to show that $R$ is almost surely finite. Any hints?
Hints: