/* -*- coding: utf-8 -*-
 *
 * 3707.cc:  No.3707 Unique Ticket - yukicoder
 */

#include<cstdio>
#include<bitset>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_M = 100;

/* typedef */

using btst = bitset<MAX_M>;

/* global variables */

char s[MAX_M + 4];
btst bs[MAX_N];
int cs[MAX_M];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    for (int j = 0; j < m; j++)
      if (s[j] == 'o') bs[i][j] = 1;
  }

  fill(cs, cs + m, -1);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (bs[i][j]) {
	if (cs[j] < 0) cs[j] = i;
	else cs[j] = n;
      }
  //for (int j = 0; j < m; j++) printf(" %d", cs[j]); putchar('\n');

  int cnt = 0;
  for (int i = 0; i < n; i++)
    if (bs[i].count()) {
      bool ok = true;
      for (int j = 0; ok && j < m; j++)
	ok = (! bs[i][j] || cs[j] == i);
      if (ok) cnt++;
    }

  printf("%d\n", cnt);
  
  return 0;
}