A grid strip of size is divided into 100 segments. An integer is written in each cell, and the numbers in cells lying within the same segment are the same. A token is placed in each cell. Then, an operation is performed where all tokens are simultaneously moved, each token moving to the right by the number of cells indicated in its cell (if the number is negative, the token moves to the left); it turns out that each cell again contains a token. This operation is repeated many times. For each token from the first segment, the number of operations is counted until it first returns to this segment. Prove that there are no more than 100 different numbers among the obtained counts.