Let be the set of distinct ways in which the vertices of a -cycle may be coloured with at most two colours, called \emph{colouring types}, and let . Suppose we colour the vertices of with at most two colours. If is a -cycle decomposition of , such that the colouring type of each -cycle is in , and every colouring type in is represented in , then is said to have a \emph{proper colouring type} . For all with , we determine some necessary conditions for the existence of a -cycle decomposition of with proper colouring type . In many cases, we show that these conditions are also sufficient.