HMMT 2002 T8

In this problem only, assume that $s_{1}=4$ and that exactly one board square, say square number $n$, is marked with an arrow. Determine all choices of $n$ that maximize the average distance in squares the first player will travel in his first two turns.