#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;

class BipartiteMatching {
  bool dfs(int v) {
    used[v] = true;
    for (int i = 0; i < (int) G[v].size(); i++) {
      int u = G[v][i], w = match[u];
      if (w < 0 || (!used[w] && dfs(w))) {
        match[v] = u;
        match[u] = v;
        return true;
      }
    }
    return false;
  }

  public:
  int V;
  vector<vector<int>> G;
  vector<int> match;
  vector<bool> used;

  BipartiteMatching(int V) : V(V), G(V), match(V, -1), used(V) {}

  void add_edge(int u, int v) {
    G[u].push_back(v);
    G[v].push_back(u);
  }

  int matching() {
    int res = 0;
    for (int v = 0; v < V; v++) {
      if (match[v] < 0) {
        fill(used.begin(), used.end(), 0);
        if (dfs(v)) {
          res++;
        }
      }
    }
    return res;
  }
};

void Main() {
  int H, W;
  cin >> H >> W;
  vector<string> B(H);
  rep(y, H) cin >> B[y];

  auto node_id = [&](int y, int x){ return y * W + x; };

  BipartiteMatching bm(H * W);

  rep(y, H) rep(x, W) {
    if (x+1 <= W-1 && B[y][x] != '.' && B[y][x+1] != '.') {
      bm.add_edge(node_id(y, x), node_id(y, x+1));
    }
    if (y+1 <= H-1 && B[y][x] != '.' && B[y+1][x] != '.') {
      bm.add_edge(node_id(y, x), node_id(y+1, x));
    }
  }

  int m = bm.matching();

  int ub = 0, uw = 0;
  rep(y,H) rep(x,W) if (B[y][x] != '.') {
    if (bm.match[node_id(y, x)] == -1) {
      if ((y+x) % 2) ub++;
      else uw++;
    }
  }

  int ans = m * 100;
  int mi = min(ub, uw);
  //cout<<"uw: "<<uw<<endl;
  //cout<<"ub: "<<ub<<endl;
  //cout<<"mi: "<<mi<<endl;
  ans += mi * 10;
  ans += (ub + uw - mi * 2);

  _p("%d\n", ans);
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }