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

char mat[100][100];
int main(){
    int n, m;
    cin >> n >> m;

    int si, sj, ei, ej;
    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;
            }
            if(mat[i][j] == 'E'){
                ei = i;
                ej = j;
            }
        }
    }

    queue<int> q;
    q.push(si);
    q.push(sj);
    q.push(0);

    vector<vector<bool>> visited(n, vector<bool>(m, false));
    visited[si][sj] = true;

    while (!q.empty()) {
        int ci = q.front(); q.pop();
        int cj = q.front(); q.pop();
        int dist = q.front(); q.pop();

        if(ei == ci and ej == cj) {
            cout << dist << endl;
            return 0;
        }

        if(ci + 1 < n and mat[ci + 1][cj] != '#' and !visited[ci + 1][cj]) {
            q.push(ci + 1);
            q.push(cj);
            q.push(dist + 1);
            visited[ci + 1][cj] = true;
        }

        if(ci - 1 >= 0 and mat[ci - 1][cj] != '#' and !visited[ci - 1][cj]) {
            q.push(ci - 1);
            q.push(cj);
            q.push(dist + 1);
            visited[ci - 1][cj] = true;
        }

        if(cj + 1 < m and mat[ci][cj + 1] != '#' and !visited[ci][cj + 1]) {
            q.push(ci);
            q.push(cj + 1);
            q.push(dist + 1);
            visited[ci][cj + 1] = true;
        }
        if(cj - 1 >= 0 and mat[ci][cj - 1] != '#' and !visited[ci][cj - 1]) {
            q.push(ci);
            q.push(cj - 1);
            q.push(dist + 1);
            visited[ci][cj - 1] = true;
        }

    }
    cout << "nema pat" << endl;

    return 0;
}