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

#define int long long

int n,m;

struct P{
    int x,y;
};

bool operator <(const P &a,const P &b)
{
    return a.x<b.x||(a.x==b.x&&a.y<b.y);
}

P operator -(const P &a,const P &b)
{
    return {a.x-b.x,a.y-b.y};
}

int operator *(const P &a,const P &b)
{
    return a.x*b.y-a.y*b.x;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    set<P> s;
    for(int i=1;i<=n;i++)
    {
        string e;
        cin>>e;
        for(int j=1;j<=m;j++)
        {
            if(e[j-1]=='#')
            {
                s.insert({i,j});
                // for(auto dx:{-1,0,1})
                //     for(auto dy:{-1,0,1})
                //         s.insert({i+dx,j+dy});
            }
        }
    }
    set<P> vis;
    int S=0,c=0;
    vector<pair<int,int> >dlt({{-1,0},{1,0},{0,-1},{0,1}});
    for(auto [x,y]:s)
    {
        if(vis.count({x,y}))
            continue;
        queue<P> q;
        q.push({x,y});
        vis.insert({x,y});
        vector<P> now;
        while(!q.empty())
        {
            auto [x,y]=q.front();
            q.pop();
            now.push_back({x,y});
            for(auto [i,j]:dlt)
            {
                if(s.find({x+i,y+j})==s.end())
                    continue;
                if(vis.count({x+i,y+j}))
                    continue;
                vis.insert({x+i,y+j});
                q.push({x+i,y+j});
            }
        }
        int B=now.size();

        for(int i=0;i<B;i++)
        {
            auto [x,y]=now[i];
            now.push_back({x+1,y});
            now.push_back({x,y+1});
            now.push_back({x+1,y+1});
        }
        sort(now.begin(),now.end());
        vector<P> conv;
        for(auto p:now)
        {
            while(conv.size()>1&&(p-conv.back())*(conv.back()-conv.end()[-2])>=0)
                conv.pop_back();
            conv.push_back(p);
        }
        reverse(now.begin(),now.end());
        int m=conv.size();
        for(auto p:now)
        {
            while(conv.size()>m&&(p-conv.back())*(conv.back()-conv.end()[-2])>=0)
                conv.pop_back();
            conv.push_back(p);
        }
        conv.pop_back();
        m=conv.size();
        int A=0;
        for(int i=0;i<m;i++)
        {
            int j=(i+1)%m;
            A+=conv[i]*conv[j];
        }
        A/=2;
        if(1.*B/A>0.6)
            S++;
        else
            c++;
    }
    S+=(c-1)*5;
    cout<<S<<"\n";
}