The identifier of a book is an n-tuple of numbers 0, 1, .... , 9, followed by a checksum. The checksum is computed by a fixed rule that satisfies the following property: whenever one increases a single number in the n-tuple (without modifying the other numbers), the checksum also increases. Find the smallest possible number of required checksums if all possible n-tuples are in use.