/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

int res,r,c;

void bfs(int i, int j, vector<vector<bool>>& ar,vector<vector<bool>>& vis)
{
    queue<pii> que;
    que.push({i,j});
    vis[i][j] = 1;
    bool t = false;
    while(!que.empty())
    {
        pii cur = que.front();
        que.pop();
        i = cur.x;
        j = cur.y;
        if(i == 0 || i == 3*r-1)
            t = true;
        if(j == 0 || j == 3*c-1)
            t = true;
        if(i > 0 && ar[i-1][j] == 0 && vis[i-1][j] == 0)
        {
            que.push({i-1,j});
            vis[i-1][j] = 1;
        }
        if(i < 3*r-1 && ar[i+1][j] == 0 && vis[i+1][j] == 0)
        {
            que.push({i+1,j});
            vis[i+1][j] = 1;
        }
        if(j > 0 && ar[i][j-1] == 0 && vis[i][j-1] == 0)
        {
            que.push({i,j-1});
            vis[i][j-1] = 1;
        }
        if(j < 3*c-1 && ar[i][j+1] == 0 && vis[i][j+1] == 0)
        {
            que.push({i,j+1});
            vis[i][j+1] = 1;
        }
    }
    if(!t)
        res++;
}

int32_t main()
{
    res = 0;
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> r >> c;
    vector<vector<bool>> ar(3*r,vector<bool>(3*c,0));
    vector<vector<bool>> vis(3*r,vector<bool>(3*c,0));
    FOR(i,0,r)
    {
        string s;
        cin >> s;
        FOR(j,0,c)
        {
            if(s[j] == '\\')
            {
                ar[3*i][3*j] = 1;
                ar[3*i+1][3*j+1] = 1;
                ar[3*i+2][3*j+2] = 1;
            }
            else if(s[j] == '/')
            {
                ar[3*i+2][3*j] = 1;
                ar[3*i+1][3*j+1] = 1;
                ar[3*i][3*j+2] = 1;
            }
        }
    }
    FOR(i,0,3*r)
        FOR(j,0,3*c)
        {
            if(ar[i][j] == 0 && vis[i][j] == 0)
                bfs(i,j,ar,vis);
        }
    cout << res;
}