#include <bits/stdc++.h>
using ll=long long;
#define rep(i,s,n) for (ll i = (s); i < (n); i++)
using namespace std;
using Graph = vector<vector<ll>>;
ll MOD=1e9+7;
const ll INF=1e18;


int main(){
  ll h,w;
  cin>>h>>w;
  ll x0,y0,x1,y1;
  x0=0;y0=0;x1=h-1;y1=w-1;
  
  vector<char> G(h*w);

  rep(i,0,h){
    rep(j,0,w){
      cin>>G[i*w+j];
    }
  }
  vector<ll> C(h*w);
  //vector<bool> seen(h*w);
  queue<pair<ll,ll>> q;
  q.push({x0*w+y0,0});
  C[0]=1;
  vector<ll> dx={1,0}; 
  vector<ll> dy={0,1};
  ll ans=0;

  while(!q.empty()){
    ll v=q.front().first;
    ll j=q.front().second;
    q.pop();
    ll vx=v/w;
    ll vy=v%w;
    if(G[v]=='o'){
      j++;
    }
    else if(G[v]=='x'){
      j--;
    }
    else{
      continue;
    }

    rep(i,0,2){
      ll nx=vx+dx[i];
      ll ny=vy+dy[i];
      ll nv=nx*w+ny;
      if(nx==x1&&ny==y1){
        ans++;
      }
      if(nx>=0 && nx<h && ny>=0 && ny<w && !(G[nv]=='x' && j<1)){
        q.push({nv,j});
      }    
    }
  }
  cout<<ans<<endl;
}