#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const ll mod = 998244353;
// using Graph = vector<vector<pair<int,int>>>;
using Graph = vector<vector<int>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int H,W; cin >> H >> W;
  vector<vector<char>> G(H+2,vector<char>(W+2,'#'));
  for(int i = 1; i <= H; i++){
    for(int j = 1; j <= W; j++){
      cin >> G[i][j];
    }
  }
  
  int ans = 0;
  queue<vector<int>> q;
  q.push({1,1,1});
  while(!q.empty()){
    auto v = q.front();
    q.pop();
    int j = v[0], x = v[1], y = v[2];
    
    if(x == H && y == W) ans++;
    
    if(G[x+1][y] == 'o'){
      q.push({j+1,x+1,y});
    }
    if(G[x+1][y] == 'x' && j-1 > 0){
      q.push({j-1,x+1,y});
    }
    if(G[x][y+1] == 'o'){
      q.push({j+1,x,y+1});
    }
    if(G[x][y+1] == 'x' && j-1 > 0){
      q.push({j-1,x,y+1});
    }
  }
  
  cout << ans << endl;
}