3. A chess piece moves along the edges of a regular hexagon with a side length of $1 \mathrm{~cm}$, starting from point $A$. On the first move, it travels $1 \mathrm{~cm}$ to reach point $B$, on the second move, it travels $2 \mathrm{~cm}$ to reach point $D$, $\cdots \cdots$, on the $n$-th move, it travels $n \mathrm{~cm}$, until the 100th move is completed. At the point where the chess piece arrives the most times (the initial $A$ point also counts as one arrival), it has arrived $\qquad$ times.
$34$