We have a set of 2n positive integers whose sum is a multiple of n. One operation consists of choosing n of them and adding the same positive integer to all of them. Show that, starting from the initial 2n numbers, we can get all are equal, performing a maximum of 2n - 1 operations.