Paths with two blocks in image-chromatic digraphs

A block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic digraph contains a path of length image consisting of two blocks, one of which has length one. We then study the general problem of whether an n-chromatic digraph contains a path of length image consisting of two blocks of specified lengths.