Perfect colorings of the crossed prism graph

A crossed prism graph is a graph obtained by taking two disjoint infinite cycles (vertices of upper cycle are even integers, and vertices of lower cycle - odd ones) and adding edges (i,i+3) for i=4p and (i,i-1) for i=4p+2 (p in Z). We obtain a complete description of perfect colorings with an arbitrary number of colors of such graph. It is proved that all its perfect colorings are exhausted by disjunctive ones except of four sporadic cases.