There are n number of 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?