N,M = map(int,input().split())
S = [input().strip() for _ in range(N)]
for i in range(N):
    s = S[i]
    a = set()
    for j in range(M):
        if s[j]=="o":
            a.add(j)
    S[i] = a
S = sorted(S,key=lambda x:len(x))
K = 1
A = S[0]
Ind = set([0])
while len(A)<M:
    amin = 100000
    bmin = set()
    indmin = 0
    for i in range(N):
        if i in Ind:continue
        a = S[i]
        b = a-A
        if len(b)<amin:
            amin = len(b)
            bmin = b
            indmin = i
    A = A|bmin
    Ind.add(indmin)
    K += 1
print(K)