Rado's boundedness conjecture

Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.