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

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,"Line:",__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

int buf[55*55*55*55];
int s1,s2,s3,s4;

int&dp(int a,int b,int c,int d){
	return buf[(((a*s2)+b)*s3+c)*s4+d];
}

int imos[110][110];
int sum(int r1,int r2,int c1,int c2){
	dmp2(r1,r2,c1,c2);
	if(r1>=r2||c1>=c2)return 0;
	return imos[r2][c2]-imos[r2][c1]-imos[r1][c2]+imos[r1][c1];
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int h,w;cin>>h>>w;
	
	vc<string> s(h);
	rep(i,h)
		cin>>s[i];
	
	int er=0,ec=0;
	rep(i,h)rep(j,w)if(s[i][j]=='E')
		tie(er,ec)=pi(i,j);
	
	rep(i,h)rep(j,w){
		imos[i+1][j+1]=s[i][j]=='o';
	}
	rep(i,h+1)rep(j,w)
		imos[i][j+1]+=imos[i][j];
	rep(i,h)rep(j,w+1)
		imos[i+1][j]+=imos[i][j];
	
	s1=er+1;
	s2=h-er;
	s3=ec+1;
	s4=w-ec;
	
	rep(i,s1)rep(j,s2)rep(k,s3)rep(l,s4){
		if(i<s1-1){
			int x=0;
			if(j<er-i){
				x=sum(er-i-1,er-i,max(l,ec-k),min(ec+1+l,w-k));
			}
			chmax(dp(i+1,j,k,l),dp(i,j,k,l)+x);
		}
		if(j<s2-1){
			int x=0;
			if(er+1+j<h-i){
				x=sum(er+1+j,er+1+j+1,max(l,ec-k),min(ec+1+l,w-k));
			}
			chmax(dp(i,j+1,k,l),dp(i,j,k,l)+x);
		}
		if(k<s3-1){
			int x=0;
			if(l<ec-k){
				x=sum(max(j,er-i),min(er+1+j,h-i),ec-k-1,ec-k);
			}
			chmax(dp(i,j,k+1,l),dp(i,j,k,l)+x);
		}
		if(l<s4-1){
			int x=0;
			if(ec+1+l<w-k){
				x=sum(max(j,er-i),min(er+1+j,h-i),ec+1+l,ec+1+l+1);
			}
			chmax(dp(i,j,k,l+1),dp(i,j,k,l)+x);
		}
	}
	
	cout<<dp(s1-1,s2-1,s3-1,s4-1)<<endl;
}


Measured memory_bytes: 26880