# Don't Get Rooked

Source : ACM ICPC Mid-Central USA 1998 |
|||

Time limit : 1 sec |
Memory limit : 32 M |

**Submitted** : 280, **Accepted** : 195

In chess, the rook is a piece that can move any number of squares
vertically or horizontally. In this problem we will consider small
chess boards (at most 4 * 4) that can also contain walls through which
rooks cannot move. The goal is to place as many rooks on a board as
possible so that no two can capture each other. A configuration of
rooks is

**provided that no two rooks are on the same horizontal row or vertical column unless there is at least one wall separating them.***legal*

The following image shows five pictures of the same board. The
first picture is the empty board, the second and third pictures show legal
configurations, and the fourth and fifth pictures show illegal configurations.
For this board, the maximum number of rooks in a legal configuration
is 5; the second picture shows one way to do it, but there are several
other ways.

Your task is to write a program that, given a description of a board, calculates the maximum number of rooks that can be placed on the board in a legal configuration.

## Input

The input file contains one or more board descriptions, followed by a line containing the number 0 that signals the end of the file. Each board description begins with a line containing a positive integer**that is the size of the board;***n***will be at most 4. The next***n***lines each describe one row of the board, with a `***n*`.`' indicating an open space and an uppercase ``X`' indicating a wall. There are no spaces in the input file.

## Output

For each test case, output one line containing the maximum number of rooks that can be placed on the board in a legal configuration.

## Sample Input

4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0

## Sample Output

5 1 5 2 4