A. Purification（cf-div1-A）

A. Purification

http://codeforces.com/contest/329/problem/A

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 1 through 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

Copy

3
.E.
E.E
.E.

Output

Copy

1 1
2 2
3 3

Input

Copy

3
EEE
E..
E.E

Output

Copy

-1

Input

Copy

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

Output

Copy

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:

啊折磨死了。真的是很生气啊。题意就是看能不能全净化。很明显，只要不存在行全是E&&列全是E的这种就行。

没想到wa在了31组样例。仔细一想，要么行全覆盖，要么列全覆盖，行不行就列。

代码很丑。才几天没敲。。

代码：

#include<bits/stdc++.h>
using namespace std;
int s[200][200];
int main()
{
    int n;
    char c;
    int lala,haha;
    while(scanf("%d",&n)!=EOF){
        haha=lala=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                cin>>c;
                if(c=='E')
                    s[i][j]=1;
                else
                    s[i][j]=0;
            }
        }
       int lala;
       for(int i=1;i<=n;i++){
            if(lala!=2)
            lala=0;
            if(haha!=2)
            haha=0;
            for(int j=1;j<=n;j++){
                if(s[i][j]==0 && lala!=2)
                {
                    lala=1;
                }
                if(s[j][i]==0 && haha!=2){
                    haha=1;
                }
            }
       ///     cout<<"haha:"<<haha<<"  lala:"<<lala<<endl;
            if(lala==0)
            {
                lala=2;
            }
            if(haha==0){
                haha=2;
            }
           ///  cout<<"haha:"<<haha<<"  lala:"<<lala<<endl;
       }
       if(lala==2 && haha==2){
        cout<<"-1"<<endl;
        continue;
       }
       int hang[200],lie[200];
       memset(hang,0,sizeof(hang));
       memset(lie,0,sizeof(lie));
       int cnt=0;
       for(int i=1;i<=n;i++){
             if(cnt>=n)
            break;
        for(int j=1;j<=n;j++){
            if( s[i][j]==0 && (hang[i]==0 ||lie[j]==0)){
               /// cout<<i<<" "<<j<<endl;
                hang[i]=1;
                lie[j]=1;
                cnt++;
                break;
            }
        }
       }
       if(cnt==n){
         memset(hang,0,sizeof(hang));
       memset(lie,0,sizeof(lie));
       for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if( s[i][j]==0 && (hang[i]==0 ||lie[j]==0)){
                cout<<i<<" "<<j<<endl;
                hang[i]=1;
                lie[j]=1;
                cnt++;
                break;
            }
        }
       }
       }
       else
       {
       memset(hang,0,sizeof(hang));
       memset(lie,0,sizeof(lie));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if( s[j][i]==0 && (lie[i]==0)){
                    cout<<j<<" "<<i<<endl;
                    hang[j]=1;
                    lie[i]=1;
                    cnt++;
                    break;
                }
            }
       }
       }
    }

}