#include <fstream>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int bine(int ii, int jj,int n, int m)
{
    return(ii>=0 and ii<n and jj>=0 and jj<m);
}
void lee(int n,int m, int mat[][100],int xi, int yi)
{
    int k,ii,jj,cx[10000],cy[10000],pi,ps;
    cx[0]=xi;
    cy[0]=yi;
    pi=0;
    ps=0;
    int dx[]={1,0,-1,0,-1,-1,1,1};
    int dy[]={0,1,0,-1,-1,1,-1,1};
    mat[xi][yi]=1;
    while(pi<=ps)
    {
        for(k=0;k<8;k++)
        {
            ii=cx[pi]+dx[k];
            jj=cy[pi]+dy[k];
            if(bine(ii,jj,n,m)==1)/// daca folosesc bordare scap de aceasta functie
            if(mat[ii][jj]==0)
            {
                mat[ii][jj]=mat[cx[pi]][cy[pi]]+1;///programare dinamica(P.D)
                ps++;
                cx[ps]=ii;
                cy[ps]=jj;
            }
        }
        pi++;
    }
}
int main()
{int n,m,mat[100][100],mat2[100][100],xi,yi,xf,yf,i,j,ir,jr,minn,X;
    in>>n>>m;
    char x[100];
    in.get();
    for(i=0;i<=n;i++)
    {
        in.getline(x,101,'\n');
        for(j=0;j<=m;j++)
        {
            mat[i][j]=0;
            mat2[i][j]=0;

        if(x[j]=='X')
        {
            mat[i][j]=1;
            mat2[i][j]=1;
        }
        if(x[j]=='R')
        {
            xi=i;
            yi=j;
        }
        if(x[j]=='J')
        {
            xf=i;
            yf=j;
        }

        }
    }
    lee(n,m,mat,xi,yi);
    lee(n,m,mat2,xf,yf);
    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
            if(mat[i][j]==mat2[i][j])
            {
                if(mat[i][j]<minn)
                {
                    minn=mat[i][j];
                    ir=i;
                    jr=j;
                }

            }

    }
    out<<minn;


    return 0;
}