codeforces 330C Purification

C. Purification

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are an adventurer currently journeying inside an evil temple. After defeating a couple of weak zombies, you arrived at a square room consisting of tiles forming an n × n grid. The rows are numbered 1 through n from top to bottom, and the columns are numbered 1through n from left to right. At the far side of the room lies a door locked with evil magical forces. The following inscriptions are written on the door:

The cleaning of all evil will awaken the door!

Being a very senior adventurer, you immediately realize what this means. You notice that every single cell in the grid are initially evil. You should purify all of these cells.

The only method of tile purification known to you is by casting the "Purification" spell. You cast this spell on a single tile — then, all cells that are located in the same row and all cells that are located in the same column as the selected tile become purified (including the selected tile)! It is allowed to purify a cell more than once.

You would like to purify all n × n cells while minimizing the number of times you cast the "Purification" spell. This sounds very easy, but you just noticed that some tiles are particularly more evil than the other tiles. You cannot cast the "Purification" spell on those particularly more evil tiles, not even after they have been purified. They can still be purified if a cell sharing the same row or the same column gets selected by the "Purification" spell.

Please find some way to purify all the cells with the minimum number of spells cast. Print -1 if there is no such way.

Input

The first line will contain a single integer n (1 ≤ n ≤ 100). Then, n lines follows, each contains n characters. The j-th character in the i-th row represents the cell located at row i and column j. It will be the character 'E' if it is a particularly more evil cell, and '.' otherwise.

Output

If there exists no way to purify all the cells, output -1. Otherwise, if your solution casts x "Purification" spells (where x is the minimum possible number of spells), output x lines. Each line should consist of two integers denoting the row and column numbers of the cell on which you should cast the "Purification" spell.

Examples

input

3
.E.
E.E
.E.

output

1 1
2 2
3 3

input

3
EEE
E..
E.E

output

-1

input

5
EE.EE
E.EE.
E...E
.EE.E
EE.EE

output

3 3
1 3
2 2
4 4
5 3

Note

The first example is illustrated as follows. Purple tiles are evil tiles that have not yet been purified. Red tile is the tile on which "Purification" is cast. Yellow tiles are the tiles being purified as a result of the current "Purification" spell. Green tiles are tiles that have been purified previously.

In the second example, it is impossible to purify the cell located at row 1 and column 1.

For the third example:

题目大意：在一个点可以净化该行该列的所有格子，如果可以净化所有的格子，就输出每个格子的位置，否则输出-1

如果有一行一列全都是E，那么必然是不能净化的。其他的话只要输出每一行或者每一列第一个正常的就好了

#include <iostream>
using namespace std;
const int maxn=110;
char map[maxn][maxn];
int row[maxn],column[maxn];
int n;
int main(){
    cin >> n;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=n;j++){
    		cin>>map[i][j];
    	}
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=n;j++){
    		if(map[i][j]=='.'){
    			cnt++;
    			row[i]=j;
    			break;
    		}
    	}
    }
    if(cnt==n){
    	for(int i=1;i<=n;i++){
    		cout<<i<<' '<<row[i]<<endl;
    	}
    	return 0;
    }
    cnt=0;
    for(int j=1;j<=n;j++){
    	for(int i=1;i<=n;i++){
    		if(map[i][j]=='.'){
    			cnt++;
    			column[j]=i;
    			break;
    		}
    	}
    }
    if(cnt==n){
    	for(int i=1;i<=n;i++){
    		cout<<column[i]<<' '<<i<<endl;
    	}
    	return 0;
    }
    cout<<-1<<endl;
}