Gus has to make a list of $250$ positive integers, not necessarily distinct, such that each number is equal to the number of numbers in the list that are different from it. For example, if $15$ is a number from the list so the list contains $15$ numbers other than $15$. Determine the maximum number of distinct numbers the Gus list can contain.