There is a token in one of the nodes of a hexagon with side $n$, divided into regular triangles (see figure). Two players take turns moving it to one of the neighboring nodes, and it is forbidden to go to a node that the token has already visited. The one who loses who can't make a move. Who wins with the right game?
