#include <algorithm>
#include <array>
#include <cstdint>
#include <iostream>
#include <numeric>
#include <vector>

using namespace std;

constexpr int N = 52;

bool a[N * N];

int tin[N * N], tup[N * N], ct;

void iternei(int v, auto f) {
  for (auto di: {-1, 0, 1})
  for (auto dj: {-1, 0, 1}) if (!di ^ !dj) if (a[v + di * N + dj]) f(v + di * N + dj);
}

void calct(int v, int p) {
  tin[v] = ++ct;
  tup[v] = ct + 1;
  iternei(v, [&](int u) {
    if (u == p) return;
    else if (tin[u]) tup[v] = min(tup[v], tin[u]);
    else calct(u, v), tup[v] = min(tup[v], tup[u]);
  });
}

array<int, 2> solve(int v, int p) {
  bool W = 0;
  int s = 0;
  iternei(v, [&](int u) {
    if (tin[u] < tin[v]) return;
    auto [w, t] = solve(u, v);
    if (w == -1) W = 1;
    s += t;
  });
  if (W) return {1};
  s = 1 - s;
  if (tup[v] > tin[p]) if (s <= 0) return {1}; else return {-1};
  return {0, s};
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  vector<string> v(n);
  for (auto& s: v) cin >> s;
  for (int i = 0; i < n; ++i)
  for (int j = 0; j < m; ++j) if (v[i][j] == '.') a[i * N + j + N + 1] = 1;
  int ans = 0;
  for (int i = 0; i < N * N; ++i) if (a[i]) {
    fill(tin, end(tin), ct = 0);
    calct(i, i);
    auto [w, t] = solve(i, i);
    if (w == 1 || w != -1 && t <= 0) continue;
    ++ans;
//    cout << i / N << ' ' << i % N << '\n';
  }
  cout << ans << '\n';
}