A0A1…An is a regular polygon with n+1 vertices (n>2). Initially n stones are placed at vertex A0. In each allowed operation, 2 stones are moved simultaneously, at the player's choice: each stone is moved from the vertex where it is located to one of the adjacent 2 vertices. Find all the values of n for which it is possible to have, after a succession of permitted operations, a stone at each of the vertices A1,A2,…,An.Clarification: The two stones that move in an allowed operation can be at the same vertex or at different vertices. combinatoricsgeometrycombinatorial geometry