For each positive integer n, let S(n) denote the sum of the digits of n. How many three-digit n's are there such that S(n) = n (mod 9) ?
