///////////////////////////////////////////////////////
#include <stdio.h>
#include <array>
#include <random>
#include <queue>
std::mt19937_64 rng(0x3d03d);
#include <math.h>
#include <time.h>
#include <assert.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <set>
#define ld(x) printf("%d\n",x)
#define int long long
using std::vector;
using vi=vector<int>;
using pi=std::pair<int,int>;
using vpi=vector<pi>;
#define x first
#define y second
inline int min(int a,int b){return a>b?b:a;}
inline int max(int a,int b){return a<b?b:a;}
inline int read()
{
    int num=0,f=1;char c=getchar();
    while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
    while(c>47&&c<58)num=num*10+(c^48),c=getchar();
    return num*f;
}
char a[1005][1005],b[1005][1005];
char s[1005][1005];
int res=-5;
void find(vpi v)
{
    vi cnt(v.size()+2),mn(cnt.size(),1e9),xx(cnt.size());
    for(auto[x,y]:v)cnt[x]++,mn[x]=min(mn[x],y),xx[x]=max(xx[x],y);
    for(int i=0;i<mn.size();i++)
    {
        if(mn[i]<=xx[i]&&xx[i]-mn[i]+1!=cnt[i])
        {
            res+=5;
            return;
        }
    }
    int mx=0;
    for(auto t:cnt)mx=max(mx,t);
    int tot=0,qwq=0;
    for(auto t:cnt)
        tot+=t>0,qwq+=t>mx*2/3;
    if(qwq>tot*2/3)res++;
    else res+=5;
}
namespace qwq{
    int n;
#define ben pi
// ben *p;
vpi p;
ben s[10005];
double check(ben a1,ben a2,ben b1,ben b2)//妫€鏌ュ弶绉槸鍚﹀ぇ浜�0锛屽鏋滄槸a灏遍€嗘椂閽堣浆鍒癰 
{
    return (a2.x-a1.x)*(b2.y-b1.y)-(b2.x-b1.x)*(a2.y-a1.y);
}
double d(ben p1,ben p2)//涓ょ偣闂磋窛绂汇€傘€傘€� 
{
    return sqrt((p2.y-p1.y)*(p2.y-p1.y)+(p2.x-p1.x)*(p2.x-p1.x));
}
bool cmp(ben p1,ben p2)//鎺掑簭鍑芥暟锛岃繖涓嚱鏁板埆鍐欓敊浜嗭紝瑕佷笉鐒跺姛浜忎竴绡� 
{
    double tmp=check(p[1],p1,p[1],p2);
    if(tmp>0) 
		return 1;
    if(tmp==0&&d(p[0],p1)<d(p[0],p2)) 
		return 1;
    return 0;
}
int main(vpi A,int N)
{
	p=A;n=N;
    // scanf("%d",&n);
    double mid;
    for(int i=1;i<=n;i++)
    {
        scanf("%lf%lf",&p[i].x,&p[i].y);
        if(i!=1&&p[i].y<p[1].y)//杩欐槸鏄幓閲� 
        {
            mid=p[1].y;p[1].y=p[i].y;p[i].y=mid;
            mid=p[1].x;p[1].x=p[i].x;p[i].x=mid;
        }
    } 
    sort(p.begin()+2,p.begin()+1+n,cmp);//绯荤粺蹇帓 
    s[1]=p[1];//鏈€浣庣偣涓€瀹氬湪鍑稿寘閲� 
    int cnt=1;
    for(int i=2;i<=n;i++)
    {
        while(cnt>1&&check(s[cnt-1],s[cnt],s[cnt],p[i])<=0) //鍒ゆ柇鍓嶉潰鐨勪細涓嶄細琚涪璧帮紝濡傛灉琚涪璧伴偅涔堝嚭鏍�
			cnt--;
        cnt++;
        s[cnt]=p[i];
    }
    s[cnt+1]=p[1];//鏈€鍚庝竴涓偣鍥炲埌鍑稿寘璧风偣
    double ans=0; 
    // for(int i=1;i<=cnt;i++) printf("(%d,%d)\n",s[i].x,s[i].y);
    // for(int i=1;i<=n;i++) printf("(%d,%d)\n",p[i].x,p[i].y);
    for(int i=2;i<=cnt;i++) 
    {
        int x1=s[1].x-s[i].x;
        int y1=s[1].y-s[i].y;
        int x2=s[1].x-s[i+1].x;
        int y2=s[1].y-s[i+1].y;
        ans+=fabs(x1*y2-x2*y1)/2;
    }
		// ans+=d(s[i],s[i+1]);//鐒跺悗s閲屽瓨濂戒簡鍑稿寘搴忓垪锛屽彧闇€瑕佹妸涓や袱璺濈绱姞灏辫
    // printf("%.2lf %d\n",ans,n);
    if(n>ans*0.91)res+=1;
    else res+=5;
    return 0;
}
}
signed main()
{
	int n=read(),m=read();
    for(int i=1;i<=n;i++)scanf("%s",a[i]+1);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)if(a[i][j]=='#')
        {
            std::queue<pi>q;
            q.push({i,j});
            a[i][j]='.';
            vpi v={{0,0}};
            while(!q.empty())
            {
                pi u=q.front();q.pop();
                v.push_back(u);
                for(auto [dx,dy]:(vpi){{1,0},{-1,0},{0,1},{0,-1}})
                {
                    if(a[u.first+dx][u.second+dy]=='#')
                        a[u.first+dx][u.second+dy]='.',
                        q.push({u.first+dx,u.second+dy});
                }
            }
            // for(auto &[x,y]:v)x-=i-1;
            // find(v);
            qwq::main(v,v.size()-1);
        }
    printf("%d\n",res);
	fprintf(stderr,"%.12lf\n",1.*clock()/CLOCKS_PER_SEC);
    // for(int i=1;i<=n;i++)
    //     for(int j=1;j<=m;j++)
    //         if(a[i][j-1]=='#'&&a[i][j+1]=='#'&&a[i-1][j]=='#'&&a[i+1][j]=='#')
    //             b[i][j]=1;
    // for(int i=1;i<=n;i++)
    //     for(int j=1;j<=m;j++)
    //         if(b[i][j])a[i][j]='.';
    // for(int i=1;i<=n;i++)puts(a[i]+1);
	return 0;
}