# 事前に数えて2以上がないかを見る解法
N, M = map(int, input().split())
S = [input() for _ in range(N)]
C = [0] * M
f = [1] * N
for i in range(M):
    for j in range(N):
        if S[j][i] == "o":
            C[i] += 1

for i in range(N):
    flag = 0
    for j in range(M):
        if S[i][j] == "o":
            flag = 1
            if C[j] >= 2:
                f[i] = 0
                break
    else:
        if not flag:
            f[i] = 0
print(sum(f))