Jacek has $n$ cards numbered consecutively with the numbers $1,. . . , n$, which he places in a row on the table, in any order he chooses. Jacek will remove cards from the table in the sequence consistent with the numbering of cards: first they will remove the card number $1$, then the card number $2$, and so on. Before Jacek starts taking the cards, Pie will color each one of cards in red, blue or yellow. Prove that Pie can color the cards in such a way that when Jacek takes them off, it will be fulfilled at every moment the following condition: between any two cards of the same suit there is at least one card of a different color.