The vertices of the regular $n$-gon and its center are marked. Two players play the following game: they, in turn, select a vertex and connect it by a segment to either the adjacent vertex or the center. The winner I a player if after his maveit is possible to get any marked point from any other moving along the segments. For each $n>2$ determine who has a winning strategy.