Puzzle 41 / Slitherlink [Clones]

I survived midterms.

This is a Slitherlink mutant. Draw a loop through adjacent vertices that cannot intersect itself. Each number indicates how many of the four edges around it are drawn. In addition, each pair of colored squares in corresponding positions (e.g. R1C1 and R6C6, R2C8 and R7C3) must have an equal number of edges drawn around them (i.e. if there were numbers placed there, they would be equal).


(note: the commenting setup here is experimental and I may not check my comments often; if you want to tell me something instead of the world, email me!)