module Solution (solution) where
f n = if mod n 2 == 0 then div n 2 else 3 * n + 1
solution z k
| k == 0 = z
| z == 1 = case k `mod` 3 of
0 -> 1
1 -> 4
2 -> 2
| otherwise = solution (f z) (k-1)