// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#include <queue>
using namespace std;

const int INF=1e9;

int main() {
	int n, m;cin>>n>>m;
    vector<vector<int>> a(n, vector<int> (m, -1));
    vector<vector<array<int, 2>>> elek(n*m);
    int hihi=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            char c;
            cin>>c;
            if(c=='S'){
                a[i][j]=0;
            }else if(c=='N'){
                a[i][j]=2;
            }else if(c=='W'){
                a[i][j]=3;
            }else if(c=='E'){
                a[i][j]=1;
            }
   //         cout<<a[i][j]<<' ';
        }
    //    cout<<endl;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(a[i][j]==-1){hihi++; continue;}
            if(i!=0){
                if(a[i][j]!=-1){
                    int hhhh=a[i][j];
                    if(a[i][j]<2){
                        a[i][j]+=4;
                    }
                    elek[hihi].push_back({abs(a[i][j]-2), hihi-m});
                    a[i][j]=hhhh;
                }
            }
            if(i!=n-1){
                if(a[i][j]!=-1){
                    elek[hihi].push_back({abs(a[i][j]-0), hihi+m});
                }
            }
            if(j!=0){
                if(a[i][j]!=-1){
                    int hhhh=a[i][j];
                    if(a[i][j]<3){
                        a[i][j]+=4;
                    }
                    elek[hihi].push_back({abs(a[i][j]-3), hihi-1});
                    a[i][j]=hhhh;
                }
            }
            if(j!=m-1){
                if(a[i][j]!=-1){
                    int hhhh=a[i][j];
                    if(a[i][j]<1){
                        a[i][j]+=4;
                    }
                    elek[hihi].push_back({abs(a[i][j]-1), hihi+1});
                    a[i][j]=hhhh;
                }
            }
            hihi++;
        }
    }
    /*for(int i=0;i<n*m;i++){
        for(auto[x, y]: elek[i]){
            cout<<i<<' '<<y<<' '<<x<<'\n';
        }
    }*/
    priority_queue<array<int, 2>> q;
    vector<int> dist(n*m, INF);
    vector<bool> vis(n*m, false);
    dist[0]=0;
    q.push({0, 0});
    while(!q.empty()){
        int x=q.top()[0], y=q.top()[1];
        if(vis[y]){
            q.pop();
            continue;
        }
        vis[y]=true;
        q.pop();
        for(auto[z, h]: elek[y]){
            if(dist[h]>dist[y]+z){
                dist[h]=dist[y]+z;
                q.push({-dist[h], h});
            }
        }
    }
    if(dist[n*m-1]==INF){
        cout<<-1<<'\n';
    }else{
        cout<<dist[n*m-1]<<'\n';
    }
}