The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \mod 9$. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is ________. (answer in integer)