CONO-SUR 1999 Problem 4

Let $A$ be a six-digit number, three of which are colored and equal to $1, 2$ , and $4$ . Prove that it is always possible to obtain a number that is a multiple of $7$ , by performing only one of the following operations: either delete the three colored figures, or write all the numbers of $A$ in some order.