There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

See OEIS A350599 for the first few numerical values.