A collection of \( n \) balls is distributed in several boxes, with no box containing 100 or more balls. In one move, we can remove several (at least one, possibly all) balls from one box. Find the smallest positive integer \( n \) with the following property: regardless of the distribution, we can make moves such that each non-empty box contains the same number of balls and the total number of remaining balls is at least 100.