Each vertex of a regular $1997$-gon is labeled with an integer, so that the sum of the integers is $1$. We write down the sums of the first $k$ integers read counterclockwise, starting from some vertex $(k=1,2,\ldots,1997)$. Can we always choose the starting vertex so that all these sums are positive? If yes, how many possible choices are there?