#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
int n,m;
int conv(pii p){
return p.first*m+p.second;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
cin>>n>>m;
char grid[n][m];
f0r(i,n)f0r(j,m)cin>>grid[i][j];
pii st;
pii en;
f0r(i,n){
f0r(j,m){
if(grid[i][j] == 'S')st = mp(i,j);
if(grid[i][j] == 'C')en = mp(i,j);
}
}
vector<vector<pii>> adj3(n*m);
vvi adj(n*m);
f0r(i,n){
f0r(j,m){
pii cur = mp(i,j);
if(i != 0 && grid[i-1][j] != '#'){
adj[conv(cur)].pb(conv(mp(i-1,j)));
}
if(i != n-1 && grid[i+1][j] != '#'){
adj[conv(cur)].pb(conv(mp(i+1,j)));
}
if(j != 0 && grid[i][j-1] != '#'){
adj[conv(cur)].pb(conv(mp(i,j-1)));
}
if(j != m-1 && grid[i][j+1] != '#'){
adj[conv(cur)].pb(conv(mp(i,j+1)));
}
}
}
f0r(i, n*m){
for(auto u : adj[i]){
adj3[i].pb(mp(u,1));
}
}
queue<int>q;
vi towall(n*m, 4e18);
f0r(i,n*m){
if(adj[i].size() != 4){
q.push(i);
towall[i] = 0;
}
}
while(!q.empty()){
int node = q.front();
q.pop();
for(auto u : adj[node]){
if(towall[u] == 4e18){
towall[u] = towall[node] + 1;
q.push(u);
}
}
}
f0r(i,n){
int prevleft = -1;
f0r(j,m){
if(j == 0 || grid[i][j-1] == '#'){
if(grid[i][j] != '#')prevleft = j;
}
else{
if(grid[i][j] != '#')adj3[conv(mp(i,j))].pb(mp(conv(mp(i,prevleft)),1+towall[conv(mp(i,j))]));
}
}
}
f0r(i,n){
int prevleft = -1;
for(int j = m-1; j>=0; j--){
if(j == m-1 || grid[i][j+1] == '#'){
if(grid[i][j] != '#')prevleft = j;
}
else{
if(grid[i][j] != '#')adj3[conv(mp(i,j))].pb(mp(conv(mp(i,prevleft)), 1+towall[conv(mp(i,j))]));
}
}
}
f0r(i,m){
int prevleft = -1;
f0r(j,n){
if(j == 0 || grid[j-1][i] == '#'){
if(grid[j][i] != '#')prevleft = j;
}
else{
if(grid[j][i] != '#'){
adj3[conv(mp(j,i))].pb(mp(conv(mp(prevleft,i)), 1+towall[conv(mp(j,i))]));
}
}
}
}
f0r(i,m){
int prevleft = -1;
for(int j = n-1; j>=0; j--){
if(j == n-1 || grid[j+1][i] == '#'){
if(grid[j][i] != '#')prevleft = j;
}
else{
if(grid[j][i] != '#'){
adj3[conv(mp(j,i))].pb(mp(conv(mp(prevleft,i)), 1+towall[conv(mp(j,i))]));
}
}
}
}
towall = vi();
/*
f0r(i,n*m){
dout(i);
vout(adj2[i]);
}
*/
priority_queue<pii>pq;
pq.push(mp(0, conv(st)));
vi dist(n * m, 4e18);
dist[conv(st)] = 0;
while(!pq.empty()){
int node = pq.top().second;
pq.pop();
for(auto u : adj3[node]){
if(dist[u.first] > dist[node] + u.second){
dist[u.first] = dist[node] + u.second;
pq.push(mp(-dist[u.first], u.first));
}
}
}
/*
f0r(i,n){
f0r(j,m){
if(dist[i*m+j] != 4e18)cout<<dist[i*m+j]<<' ';
else cout<<'o'<<' ';
}
cout<<'\n';
}
*/
out(dist[conv(en)]);
}
