#include<bits/stdc++.h>
using namespace std;
const int N=50;
char c[N][N];
int ans=INT_MAX;
int n,m,sx,sy,sd,ex,ey;
int f[N][N][5];//记忆化 
//East1,West2,North3,South4  每个方向的编号 
bool check(int x,int y)
{
	if(x>n||y>m||x<1||y<1||c[x][y]=='.') return 0;
	else return 1;
}
void dfs(int x,int y,int d,int cost)
{
	if(f[x][y][d]<=cost) return;
	f[x][y][d]=cost;
	if(x==ex&&y==ey)
	{
		ans=min(ans,f[x][y][d]);
		return;
	}
	if(d==1)
	{
		if(check(x,y+1)) dfs(x,y+1,1,cost);
		if(check(x-1,y)) dfs(x-1,y,3,cost+1);
		if(check(x+1,y)) dfs(x+1,y,4,cost+5);	
		if(check(x,y-1)) dfs(x,y-1,2,cost+10);
	}
	if(d==2)
	{
		if(check(x,y-1)) dfs(x,y-1,2,cost);
		if(check(x+1,y)) dfs(x+1,y,4,cost+1);
		if(check(x-1,y)) dfs(x-1,y,3,cost+5);
		if(check(x,y+1)) dfs(x,y+1,1,cost+10);	
	}
	if(d==3)
	{
		if(check(x-1,y)) dfs(x-1,y,3,cost);
		if(check(x,y-1)) dfs(x,y-1,2,cost+1);
		if(check(x,y+1)) dfs(x,y+1,1,cost+5);
		if(check(x+1,y)) dfs(x+1,y,4,cost+10);
	}
	if(d==4)
	{
		if(check(x+1,y)) dfs(x+1,y,4,cost);
		if(check(x,y+1)) dfs(x,y+1,1,cost+1);
		if(check(x,y-1)) dfs(x,y-1,2,cost+5);
		if(check(x-1,y)) dfs(x-1,y,3,cost+10);
	}
}
int main()
{
	memset(f,0x3f,sizeof(f));
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			cin>>c[i][j];
			if(c[i][j]=='E') sx=i,sy=j,sd=1;
			if(c[i][j]=='W') sx=i,sy=j,sd=2;
			if(c[i][j]=='N') sx=i,sy=j,sd=3;
			if(c[i][j]=='S') sx=i,sy=j,sd=4;
			if(c[i][j]=='F') ex=i,ey=j;
		}
	dfs(sx,sy,sd,0);
	cout<<ans;
	return 0;
}