#include <iostream>
#include <vector>
#include <fstream>
#include <set>

using namespace std;

int dy[] = {-1, 0, 0, 1};
int dx[] = {0, -1, 1, 0};

void floodfill(vector < vector <char> > &v, const int &i, const int &j, const char cA, const int &comp, vector < vector <int> > &n){
    v[i][j] = '*';

    n[i][j] = comp;

    for(int k = 0; k < 4; k++){
        int i2 = (i + dy[k]);
        int j2 = (j + dx[k]);

        if(v[i2][j2] == cA)
            floodfill(v, i2, j2, cA, comp, n);
    }
}

int main()
{
    ifstream in("uniformar.in", fstream::in);
    ofstream out("uniformar.out", fstream::out);

    int cant, m = 0, comp = 0;

    in >> cant;

    vector < vector <char> > v((cant + 2), vector <char>((cant + 2), '*'));
    vector < vector <int> > n((cant + 2), vector <int>((cant + 2), (-1)));

    for(int i = 1; i <= cant; i++){
        v[i][0] = '*';

        for(int j = 1; j <= cant; j++)
            in >> v[i][j];

        v[i][cant + 1] = '*';
    }

    for(int i = 1; i < int(v.size() - 1); i++){
        for(int j = 1; j < int(v.size() - 1); j++){
            if(v[i][j] != '*'){
                comp++;

                floodfill(v, i, j, v[i][j], comp, n);
            }
        }
    }

    vector < set <int> > adj(comp + 1);

    for(int i = 1; i < int(n.size() - 1); i++)
        for(int j = 1; j < int(n.size() - 1); j++)
            if(v[i][j] != (-1))
                armarLista(v, i, j, v[i][j], comp, n);

    cout << "LISTA DE ADYACENCIA: " << endl;

    for(int i = 1; i < int(adj.size()); i++){
        cout << i << " | ";
        for(auto j:adj[i])
            cout << j << endl;
        cout << endl;
    }

    in.close();
    out.close();

    return 0;
}