A path $\displaystyle P_1,P_2,\ldots,P_k$ in a simple graph is said to be a hopscotch if the degree of every point $\displaystyle P_i$ is $\displaystyle i$. What is the maximum number of points that a hopscotch may have in a simple graph on $\displaystyle n$ points?