#include <bits/stdc++.h>
using namespace std;

const int N = 101;
int n, iJ, jJ, iR, jR, ifinal, jfinal;
char grid[N][N];
int distJ[N][N], distR[N][N];
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};

bool inside(int i, int j)
{
    return i >= 1 && i <= n && j >= 1 && j <= n;
}

void bfs(int si, int sj, int dist[N][N])
{
    queue<pair<int, int>> q;
    q.push(make_pair(si, sj));
    dist[si][sj] = 0;

    while (!q.empty())
    {
        int i = q.front().first;
        int j = q.front().second;
        q.pop();

        for (int d = 0; d < 8; ++d)
        {
            int ni = i + dx[d];
            int nj = j + dy[d];
            if (inside(ni, nj) && grid[ni][nj] != 'X' && dist[ni][nj] == -1)
            {
                dist[ni][nj] = dist[i][j] + 1;
                q.push(make_pair(ni, nj));
            }
        }
    }
}

int main()
{
    freopen("rj.in", "r", stdin);
    freopen("rj.out", "w", stdout);

    scanf("%d", &n);
    getchar(); // skip newline

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            char c;
            scanf("%c", &c);
            grid[i][j] = c;

            if (c == 'J')
            {
                iJ = i;
                jJ = j;
            }
            else if (c == 'R')
            {
                iR = i;
                jR = j;
            }
        }
        getchar(); // skip newline
    }

    memset(distJ, -1, sizeof(distJ));
    memset(distR, -1, sizeof(distR));

    bfs(iJ, jJ, distJ);
    bfs(iR, jR, distR);

    int minSteps = INT_MAX;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (distJ[i][j] != -1 && distJ[i][j] == distR[i][j])
            {
                if (distJ[i][j] < minSteps)
                {
                    minSteps = distJ[i][j];
                    ifinal = i;
                    jfinal = j;
                }
            }
        }
    }

    printf("%d %d %d\n", minSteps, ifinal, jfinal);
    return 0;
}