Graph Coloring · Hard problem

Two squares, $0,1,2,3$ and $4,5,6,7$, are joined by a single bridge edge between vertex $3$ and vertex $4$ ($9$ edges in all: $4$ sides on each square plus the bridge). With $3$ colors available, how many proper colorings does this graph have?