#include <iostream>
#include<algorithm>
#include <queue>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    char mat[n][m];
    int si, sj;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
            if(mat[i][j] == 'S') {
                si = i;
                sj = j;
            }
        }
    }
    bool visited[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            visited[i][j] = false;
        }
    }
    queue<int> q;
    q.push(si);
    q.push(sj);
    q.push(0);
    visited[si][sj] = true;
    while(!q.empty()) {
        int ci = q.front();
        q.pop();
        int cj = q.front();
        q.pop();
        int distanca = q.front();
        q.pop();
        if(mat[ci][cj] == 'E') {
            cout << distanca << endl;
            break;
        }
        if(ci + 1 < n and mat[ci + 1][cj] != '#' and !visited[ci + 1][cj]) {
            visited[ci + 1][cj] = true;
            q.push(ci + 1);
            q.push(cj);
            q.push(distanca + 1);
        }
        if(ci - 1 >= 0 and mat[ci - 1][cj] != '#' and !visited[ci - 1][cj]) {
            visited[ci - 1][cj] = true;
            q.push(ci - 1);
            q.push(cj);
            q.push(distanca + 1);
        }
        if(cj + 1 < m and mat[ci][cj + 1] != '#' and !visited[ci][cj + 1]) {
            visited[ci][cj + 1] = true;
            q.push(ci);
            q.push(cj + 1);
            q.push(distanca + 1);
        }
        if(cj - 1 >= 0 and mat[ci][cj - 1] != '#' and !visited[ci][cj - 1]) {
            visited[ci][cj - 1] = true;
            q.push(ci);
            q.push(cj - 1);
            q.push(distanca + 1);
        }

    }
    return 0;
}