# θ(N^2*M) 解法(TLE想定)
import sys

def main():
    # 入力を一括で読み込む（競技プログラミングの一般的な高速化）
    input_data = sys.stdin.read().split()
    if not input_data:
        return
    
    N = int(input_data[0])
    M = int(input_data[1])
    S = input_data[2:]
    
    unique_ticket_count = 0
    
    for i in range(N):
        is_unique = True
        has_event = False
        
        for j in range(M):
            if S[i][j] == 'o':
                has_event = True
            
            for k in range(N):
                if i != k and S[i][j] == 'o' and S[k][j] == 'o':
                    is_unique = False
                    
        if has_event and is_unique:
            unique_ticket_count += 1
            
    print(unique_ticket_count)

if __name__ == '__main__':
    main()