MathNet 2011 Question 5

How many ways are there to color the vertices of a $2n$-gon with three colors such that no vertex has the same color as either of its two neighbors or the vertex directly across from it?