Probes in a colliding hash table

You insert the keys $21,\ 31,\ 41,\ 15,\ 25$ in that order into an initially empty hash table of size $10$. The hash is $h(k)=k \bmod 10$, and collisions are resolved by linear probing (if a slot is taken, try the next slot to the right, wrapping around). Count a probe as each slot the insertion inspects, so landing in an empty home slot costs $1$ probe. What is the total number of probes across all five insertions?