#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<long long>
#define MOD 1000000007
#define endl '\n'
typedef long long ll;
void print(vi v){
cout<<"Contents of vector:\n";
for(auto x : v) cout<<x<<" ";
cout<<endl<<endl;
}
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int m, n;
char ar[509][509];
int dists[509][509];
bool in(int i, int j){
return (i >= 0) && (j >= 0) && (i<m) && (j<n);
}
void bfs(int i, int j){
queue< pair<int, int> > q;
for(int i = 0; i<m; i++) for(int j = 0; j<n; j++) dists[i][j] = INT_MAX;
dists[i][j] = 0;
q.push({i, j});
while(!q.empty()){
pair<int, int> p = q.front(); q.pop();
int ci = p.first, cj = p.second;
//cout<<"Ci: "<<ci<<" cj: "<<cj<<" ar at ci, cj: "<<ar[ci][cj]<<endl;
if(ar[ci][cj] == 'E'){
//cout<<"Looking E"<<endl;
for(int i = 0; i<4; i++){
if(in(ci + dy[i], cj + dx[i])){
//cout<<"Inside with "<<ci+dy[i]<<", "<<cj+dx[i]<<endl;
if(i == 0) { /// Going W
if(dists[ci][j] + 2 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 2;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 1) { /// Going N
if(dists[ci][cj] + 3 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 3;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 2) { /// Going E
if(dists[ci][cj] < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj];
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 3) { /// Going S
if(dists[ci][cj] + 1 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 1;
q.push({ci + dy[i], cj + dx[i]});
}
}
}
}
}
if(ar[ci][cj] == 'S'){
//cout<<"Looking S"<<endl;
for(int i = 0; i<4; i++){
if(in(ci + dy[i], cj + dx[i])){
if(i == 0) { /// Going W
if(dists[ci][cj] + 1 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 1;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 1) { /// Going N
if(dists[ci][cj] + 2 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 2;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 2) { /// Going E
if(dists[ci][cj] + 3< dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 3;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 3) { /// Going S
if(dists[ci][cj]< dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj];
q.push({ci + dy[i], cj + dx[i]});
}
}
}
}
}
if(ar[ci][cj] == 'W'){
//cout<<"Looking W"<<endl;
for(int i = 0; i<4; i++){
if(in(ci + dy[i], cj + dx[i])){
if(i == 0) { /// Going W
if(dists[ci][cj] < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj];
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 1) { /// Going N
if(dists[ci][cj] + 1 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 1;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 2) { /// Going E
if(dists[ci][cj] + 2< dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 2;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 3) { /// Going S
if(dists[ci][cj] + 3 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 3;
q.push({ci + dy[i], cj + dx[i]});
}
}
}
}
}
if(ar[ci][cj] == 'N'){
//cout<<"Looking N"<<endl;
for(int i = 0; i<4; i++){
if(in(ci + dy[i], cj + dx[i])){
if(i == 0) { /// Going W
if(dists[ci][cj] + 3 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 3;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 1) { /// Going N
if(dists[ci][cj] < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj];
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 2) { /// Going E
if(dists[ci][cj] + 1 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 1;
q.push({ci + dy[i], cj + dx[i]});
}
}
if(i == 3) { /// Going S
if(dists[ci][cj] + 2 < dists[ci + dy[i]][cj + dx[i]]){
dists[ci + dy[i]][cj + dx[i]] = dists[ci][cj] + 2;
q.push({ci + dy[i], cj + dx[i]});
}
}
}
}
}
}
}
void solve(){
cin>>m>>n;
for(int i = 0; i<m; i++) for(int j = 0; j<n; j++) cin>>ar[i][j];
if(m == 1){
ll ans = 0;
for(int i = 0; i<n-1; i++){
if(ar[0][i] == 'N') ans++;
if(ar[0][i] == 'S') ans += 3;
if(ar[0][i] == 'W') ans += 2;
if(ar[0][i] == 'X'){
ans = -1;
break;
}
}
cout<<ans<<endl;
return;
}
bfs(0, 0);
if(dists[m-1][n-1] == INT_MAX) cout<<"-1"<<endl;
else cout<<dists[m-1][n-1]<<endl;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
//ifstream cin(""); ofstream cout("");///cia failai
//int T; cin>>T;
int T = 1;
for(int it = 1; it<=T; it++){
solve();
}
}
