Question 161
We put four numbers $1, 2, 3, 4$ around a circle in order. One starts at the number $1$ and at every step moves to an adjacent number on either side. In how many ways can he move so that the sum of the numbers he visits in his path (including the starting number) is equal to $21$?