#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int s=0,w=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')w=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')s=(s<<3)+(s<<1)+(c^48),c=getchar();
	return s*w;
}
inline void print(int x)
{
	if(x<0)x=-x,putchar('-');
	if(x>=10)print(x/10);
	putchar(x%10+48);
}
char a[1010][1010];
int n,m,up[1010][1010],down[1010][1010],ri[1010][1010],le[1010][1010],d[1010][1010],dx[4]={0,1,0,-1},dy[4]={1,0,-1,0},vis[1000010],dis[1000010];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
inline int id(int x,int y)
{
	return (x-1)*m+y;
}
struct node
{
	int v,w,next;
}e[10000010];
int eid=1,head[10000010];
inline void insert(int u,int v,int w)
{
	e[eid].v=v;
	e[eid].w=w;
	e[eid].next=head[u];
	head[u]=eid++;
}
int main()
{
	n=read();
	m=read();
	memset(d,0x3f,sizeof(d));
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	}
	for(int j=1;j<=m;j++)
	{
		up[1][j]=1;
		d[1][j]=0;
		for(int i=2;i<=n;i++)
		{
			if(a[i][j]=='#')
			{
				up[i][j]=i+1;
				continue;
			}
			up[i][j]=up[i-1][j];
			d[i][j]=min(d[i][j],abs(i-up[i][j]));
		}
	}
	for(int j=1;j<=m;j++)
	{
		down[n][j]=n;
		d[n][j]=0;
		for(int i=n-1;i>=1;i--)
		{
			if(a[i][j]=='#')
			{
				down[i][j]=i-1;
				continue;
			}
			down[i][j]=down[i+1][j];
			d[i][j]=min(d[i][j],abs(i-down[i][j]));
		}
	}
	for(int i=1;i<=n;i++)
	{
		le[i][1]=1;
		d[i][1]=0;
		for(int j=2;j<=m;j++)
		{
			if(a[i][j]=='#')
			{
				le[i][j]=j+1;
				continue;
			}
			le[i][j]=le[i][j-1];
			d[i][j]=min(d[i][j],abs(j-le[i][j]));
		}
	}
	for(int i=1;i<=n;i++)
	{
		ri[i][m]=m;
		d[i][m]=0;
		for(int j=m-1;j>=1;j--)
		{
			if(a[i][j]=='#')
			{
				ri[i][j]=j-1;
				continue;
			}
			ri[i][j]=ri[i][j+1];
			d[i][j]=min(d[i][j],abs(j-ri[i][j]));
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(a[i][j]=='#')continue;
			for(int k=0;k<4;k++)
			{
				int x=i+dx[k],y=j+dy[k];
				if(x<1||x>n||y<1||y>m||a[x][y]=='#')continue;
				insert(id(i,j),id(x,y),1);
			}
			//cout<<"di,j:"<<i<<' '<<j<<' '<<d[i][j]<<'\n';
			insert(id(i,j),id(i,le[i][j]),min(d[i][j]+1,abs(j-le[i][j])));
			insert(id(i,j),id(i,ri[i][j]),min(d[i][j]+1,abs(j-ri[i][j])));
			insert(id(i,j),id(up[i][j],j),min(d[i][j]+1,abs(i-up[i][j])));
			insert(id(i,j),id(down[i][j],j),min(d[i][j]+1,abs(i-down[i][j])));
		}
	}
	int s=0,t=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(a[i][j]=='S')
			{
				s=id(i,j);
			}
			if(a[i][j]=='C')
			{
				t=id(i,j);
			}
		}
	}
	memset(dis,0x3f,sizeof(dis));
	q.push({0,s});
	dis[s]=0;
	while(q.size())
	{
		int u=q.top().second;
		q.pop();
		if(vis[u])continue;
		vis[u]=1;
		for(int i=head[u];i;i=e[i].next)
		{
			int v=e[i].v;
			if(dis[v]>dis[u]+e[i].w)
			{
				//cout<<u<<' '<<v<<" "<<e[i].w<<"\n";
				dis[v]=dis[u]+e[i].w;
				q.push({dis[v],v});
			}
		}
	}
	print(dis[t]);
}