#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, m, wbc[2], ans;
string s[50];
vpii v;
set<pii> yy;
void search(pii t, bool z){
  yy.insert(t);
  each(itr, v){
    int h = itr->fi + t.fi, w = itr->se + t.se;
    if(0 <= h && h < n && 0 <= w && w < m && s[h][w] != '.' && yy.find(mp(h, w)) == yy.end()){
      if(z) ans += 100;
      search(mp(h, w), !z);
      z = false;
    }
  }
  if(z)wbc[(t.fi+t.se)%2]++;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n)cin >> s[i];
  v.pb(mp(-1, 0));
  v.pb(mp( 1, 0));
  v.pb(mp( 0,-1));
  v.pb(mp( 0, 1));
  FOR(i, 0, n)FOR(j, 0, m){
    if(s[i][j] == '.' || yy.find(mp(i, j)) != yy.end())continue;
    set<pii> y;
    queue<pii> q;
    q.push(mp(i, j));
    y.insert(mp(i, j));
    pii start = q.front();
    while(!q.empty()){
      pii t = q.front();
      q.pop();
      int cnt = 0;
      each(itr, v){
        int h = itr->fi + t.fi, w = itr->se + t.se;
        if(0 <= h && h < n && 0 <= w && w < m && s[h][w] != '.'){
          cnt++;
          if(y.find(mp(h, w)) == y.end()){
            q.push(mp(h, w));
            y.insert(mp(h, w));
          }
        }
      }
      if(cnt <= 1){
        start = t;
        while(!q.empty())q.pop();
        break;
      }
    }
    search(start, true);
  }
  if(wbc[0] > wbc[1])swap(wbc[0], wbc[1]);
  cout << ans + wbc[0] * 9 + wbc[1] << endl;
  return 0;
}