There are N buckets. All except one are filled with liquid of unique color to capacity. The last bucket is empty. What is the most efficient algorithm to end up with N buckets that all contain the mixture of all available colors in equal amounts?