#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector < vector<int> > g1(100);
vector<int> used;
void dfs (int v) {
    used[v] = 1;
    for (int i = 0 ; i < int(g1[v].size()); ++i)
        if (!used[g1[v][i]])
            dfs (g1[v][i]);
}
int main() {
    ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
    int n;cin >> n;int p=1;
    int m;cin >> m; int a[101][101]={0};
    for(int i = 0 ; i < n; i++)
    for(int j = 0 ; i < m; j++){
        char x; cin >> x;
        if(x == 'O'){ a[i][j] = p;p++;}
    }
    for(int i = 0; i < p;i++) used.push_back(0);
for(int i = 0 ; i < n; i++)
    for(int j = 0 ; i < m; j++){
        if(a[i][j] != 0){
         if( j-1>=0 && a[i][j-1] !=0){
            g1[a[i][j]].push_back(a[i][j-1]);
            g1[a[i][j-1]].push_back(a[i][j]);
          }
          if( j+1<m && a[i][j+1] !=0){
            g1[a[i][j]].push_back(a[i][j+1]);
            g1[a[i][j+1]].push_back(a[i][j]);
          }
if( i-1>=0 && a[i-1][j] !=0){
            g1[a[i][j]].push_back(a[i-1][j]);
            g1[a[i-1][j]].push_back(a[i][j]);
          }
if( i+1<n && a[i+1][j] !=0){
            g1[a[i][j]].push_back(a[i+1][j]);
            g1[a[i+1][j]].push_back(a[i][j]);
          }


      }
    }
    int k = 0;

    for(int i = 0; i < p; i++){
        if(used[i] == 0){ dfs(i); k++;}
    }
    cout << k;
}