# oj t -c "python3 main.py" import sys,math from collections import defaultdict,deque from itertools import combinations,permutations,accumulate,product from bisect import bisect,bisect_left,bisect_right from heapq import heappop,heappush,heapify #from sortedcontainers import SortedList,SortedSet def input(): return sys.stdin.readline().rstrip() def ii(): return int(input()) def ms(): return map(int, input().split()) def li(): return list(map(int,input().split())) inf = pow(10,18) #//////////////////////////////////// H,W = ms() que = deque() A = [input() for _ in range(H)] DIJ = [(0,1),(1,0),(-1,0),(0,-1)] que.append((0,0,0)) ans = 0 visited = [[-1]*W for _ in range(H)] visited[0][0] = 0 while que: i,j,c = que.popleft() if A[i][j]=='o': c += 1 else: c -= 1 if c==-1: continue if i==H-1 and j==W-1: visited[i][j] = False ans += 1 for di,dj in [(0,1),(1,0),(0,-1),(-1,0)]: ni,nj = i+di,j+dj if 0<=ni<H and 0<=nj<W: if A[ni][nj]=='#': continue if visited[ni][nj]!=-1 and visited[ni][nj]<visited[i][j]+1: continue visited[ni][nj] = visited[i][j]+1 que.append((ni,nj,c)) print(ans)