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

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n, m; cin >> n >> m;
    vector<string>a(n);
    for(string &i : a) cin >> i;
    vector<vector<pair<int, int>>>g(n*m);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            if(a[i][j] == 'X') continue;
            int x;
            if(a[i][j] == 'E') x = 0;
            else if(a[i][j] == 'N') x = 1;
            else if(a[i][j] == 'W') x = 2;
            else x = 3;
            if(j < m-1) g[i*m+j].push_back({i*m+j+1, x});
            if(i < n-1) g[i*m+j].push_back({(i+1)*m+j, (x+1)%4});
            if(j > 0) g[i*m+j].push_back({i*m+j-1, (x+2)%4});
            if(i > 0) g[i*m+j].push_back({(i-1)*m+j, (x+3)%4});
        }
    }
    vector<int>dist(n*m, 1000000);
    dist[0] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
    pq.push({0, 0});
    while(!pq.empty())
    {
        auto [d, v] = pq.top();
        pq.pop();
        if(dist[v] != d) continue;
        for(auto [u, len] : g[v])
        {
            if(dist[u] > dist[v] + len)
            {
                dist[u] = dist[v] + len;
                pq.push({dist[u], u});
            }
        }
    }
    cout << (dist[n*m-1] == 1000000 ? -1 : dist[n*m-1]);
}