The squares of a $(2^n-1)\times (2^n-1)$ chessboard are filled with $ 1$'s and $-1$'s. We say that such a configuration is acceptable if the value in each square is equal to the product of the values of its neighbors (squares with a common edge). How many acceptable configurations are there