There are n(>1)n (>1)n(>1) points on a circle, labeled as p1,p2,⋯ ,pnp_{1}, p_{2}, \cdots, p_{n}p1,p2,⋯,pn. Determine the number of ways to connect these points with a non-self-intersecting polyline p1p2⋯pnp_{1} p_{2} \cdots p_{n}p1p2⋯pn.