Find a looped path through the diagram subject to the following constraints. The path proceeds from one cell to an adjacent cell, passes through no cell more than once, does not go through any numbered cells, and never makes a sharp-angled turn (i.e., a turn at a 60^o angle). Each number indicates how many of the adjacent cells are part of the path.