#include<stdio.h>
#include<stack>

typedef struct punct
{
    int x,y;
}punct;

punct q[2000100],aux,I,O;
char v[1005][1005];

int n,m,st=1,sf,d[1005][1005],sol[1005][1005],dx[]={0,1,-1,0,0},dy[]={0,0,0,1,-1};;

inline int min(int a,int b)
{return a<b?a:b;}

void fill()
{
    int k,i;
    while(st<=sf)
    {
        aux=q[st];
        ++st;
        k=d[aux.x][aux.y];
        for(i=1;i<=4;++i)
            if(v[aux.x+dx[i]][aux.y+dy[i]]=='.'&&(d[aux.x+dx[i]][aux.y+dy[i]]==0||d[aux.x+dx[i]][aux.y+dy[i]]>k+1))
            {
                ++sf;
                q[sf].x=aux.x+dx[i];
                q[sf].y=aux.y+dy[i];
                d[q[sf].x][q[sf].y]=k+1;
            }
    }
}

void lee()
{
    int k,i;
    while(st<=sf)
    {
        aux=q[st];
        ++st;
        k=sol[aux.x][aux.y];
        for(i=1;i<=4;++i)
            if(v[aux.x+dx[i]][aux.y+dy[i]]=='.'&&(sol[aux.x+dx[i]][aux.y+dy[i]]==0||sol[aux.x+dx[i]][aux.y+dy[i]]<k))
            {
                ++sf;
                q[sf].x=aux.x+dx[i];
                q[sf].y=aux.y+dy[i];
                sol[q[sf].x][q[sf].y]=min(k,d[q[sf].x][q[sf].y]);
            }
    }
}

int main()
{
    freopen("barbar.in","r",stdin);
    freopen("barbar.out","w",stdout);
    int i,j;
    scanf("%d%d\n",&n,&m);
    for(i=0;i<n;++i)
        scanf("%s\n",v[i]);

    for(i=0;i<n;++i)
    {
        for(j=0;j<m;++j)
        {
            if(v[i][j]=='.')
                continue;
            if(v[i][j]=='D')
            {
                aux.x=i;aux.y=j;
                q[++sf]=aux;
            }
            else if(v[i][j]=='I')
            {I.x=i;I.y=j;v[i][j]='.';}
            else if(v[i][j]=='O')
            {O.x=i;O.y=j;v[i][j]='.';}

        }
    }
    //////////////////////////
    fill();

    sf=st=1;
    q[sf]=I;
    sol[q[sf].x][q[sf].y]=d[q[sf].x][q[sf].y];

    lee();


    if(sol[O.x][O.y])
        printf("%d\n",sol[O.x][O.y]);
    else
        printf("-1\n");
    return 0;
}