#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include <cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
void xrev(vector<vector<char>> &a, ll H, ll W) {
	vector<vector<char>> ret(H + 1, vector<char>(W + 1));
	repn(i, H)repn(j, W) {
		ret[i][j] = a[H + 1 - i][j];
	}
	a = ret;
}
void yrev(vector<vector<char>> &a, ll H, ll W) {
	vector<vector<char>> ret(H + 1, vector<char>(W + 1));
	repn(i, H)repn(j, W) {
		ret[i][j] = a[i][W + 1 - j];
	}
	a = ret;
}

int main(){
	ll H, W;
	cin >> H >> W;

	vector<vector<char>> a(H + 1, vector<char>(W + 1));
	ll X = 0;
	ll Y = 0;
	repn(i, H)repn(j, W) {
		cin >> a[i][j];
		if (a[i][j] == 'E') { X = i; Y = j; }
	}

	if (X > H / 2) {
		xrev(a, H, W);
		X = H + 1 - X;
	}
	if (Y > W / 2) {
		yrev(a, H, W);
		Y = W + 1 - Y;
	}

	//repn(i, H) {
	//	repn(j, W)cout << a[i][j];
	//	cout << endl;
	//}

	ll ans = 0;

	rep(x, X)rep(y, Y) {
		//cout << x << " " << y << endl;

		ll T = H - X + 1;
		ll U = W - Y + 1;

		vector<vector<char>> c(T + 1, vector<char>(U + 1, 0));

		repn(i, T) {
			repn(j, U) {
				c[i][j] = a[x + i][y + j];
				//cout << c[i][j] ;
			}
			//cout << endl;
		}
		
		vvll rui(T + 1, vll(U + 1, 0));
		repn(i, T)repn(j, U) {
			rui[i][j] = rui[i - 1][j] + rui[i][j - 1] - rui[i - 1][j - 1];
			if (c[i][j] == 'o') { rui[i][j]++; }
			//cout << i << j << rui[i][j] << endl;
		}

		vvll dp(T-X + 2, vll(U-Y + 2, 0));
		dp[1][1] = rui[X][Y];

		repn(i, T - X + 1)repn(j, U - Y + 1) {
			if (i > 1) {
				ll t = rui[i + X - 1][j - 1 + Y] - rui[i + X - 2][j - 1 + Y] - rui[i + X - 1][j - 1] + rui[i + X - 2][j - 1];
				dp[i][j] = max(dp[i][j], dp[i - 1][j] + t);
			}
			if (j > 1) {
				ll t = rui[i + X - 1][j + Y - 1] - rui[i + X - 1][j + Y - 2] - rui[i - 1][j + Y - 1] + rui[i - 1][j + Y - 2];
				dp[i][j] = max(dp[i][j], dp[i][j - 1] + t);
			}

			//cout << i << j << dp[i][j] << endl;
		}

	
		//cout << dp[T][U] << endl;
		ans = max(ans, dp[T-X+1][U-Y+1]);
	}

	cout << ans << endl;

}



Measured memory_bytes: 3780