#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

#define N 1500

char mp[N][N];

int G[N][N],vis[N],match[N],n,m;

bool dfs(int x){

    for(int i=;i<=n;i++)

        if(!vis[i] && G[x][i]){

            vis[i]=;

            if(!match[i] || dfs(match[i])){

                match[i]=x;return ;

            }

        }

    return ;

}

int work(){

    int res=;

    memset(match,,sizeof match);

    for(int i=;i<=n;i++){

        memset(vis,,sizeof vis);

        if(dfs(i))res++;

    }

    return res;

}

int cnt1,cnt2,id1[N][N],id2[N][N];//每个点对应的块序号

int main(){

    for(int i=;i<=;i++)

        for(int j=;j<=;j++)

            mp[i][j]='.';

    while(scanf("%d%d",&n,&m)!=EOF){

        for(int i=;i<=n;i++)

            for(int j=;j<=m;j++)

                scanf("\n%c",&mp[i][j]);//这样很好用 

        //标记联通块

        cnt1=,cnt2=;

        memset(id1,,sizeof id1);

        memset(id2,,sizeof id2);

        for(int i=;i<=n;i++)

            for(int j=;j<=m;j++)

                if(mp[i][j]=='*'){

                    if(mp[i][j-]==mp[i][j])

                        id1[i][j]=id1[i][j-];

                    else id1[i][j]=++cnt1;

                    if(mp[i-][j]==mp[i][j])

                        id2[i][j]=id2[i-][j];

                    else id2[i][j]=++cnt2;

                }

        //建图

        memset(G,,sizeof G);

        for(int i=;i<=n;i++)

            for(int j=;j<=m;j++)

                if(mp[i][j]=='*')

                    G[id1[i][j]][id2[i][j]]=;

        n=max(cnt1,cnt2);

        cout<<work()<<endl;

    }

}