Alex is going to give Albert a set of $n$ distinct three-digit numbers. Albert wants to pick $5$ disjoint subsets such that each has the same sum, but he doesn’t know which numbers he’ll receive. Find the smallest value of $n$ for which Albert will always be able to find his subsets.