Hitting the Opposite Node on a Cycle

A token does a symmetric random walk on the 6 vertices of a cycle (labelled 0..5, each step moving to one of the two adjacent vertices with probability 1/2 each). Starting at vertex 0, find the expected number of steps to first reach vertex 3, the diametrically opposite vertex.