#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int const MAXN=;

int R,C,bh[][][][],col[][],pre[MAXN],ans,cnt,head[MAXN],ct,bj;

char c[][],dc[];

bool vis[MAXN];

struct N{

    int to,next;

    N(int t=,int n=):to(t),next(n) {}

}edge[MAXN*];

void add(int x,int y)

{edge[++ct]=N(y,head[x]);head[x]=ct;}

bool dfs(int x)

{

    for(int i=head[x];i;i=edge[i].next)

    {

        int u=edge[i].to;

        if(!vis[u])

        {

            vis[u]=;

            if(!pre[u]||dfs(pre[u]))

                {pre[u]=x;return ;}

        }

    }

    return ;

}

int main()

{

    scanf("%d%d",&R,&C);

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

    {

        cin>>dc;

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

            c[i][j]=dc[j-];

    }

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

    {

        int j=;

        while(j<=C)

        {

            if(c[i][j]=='.'){j++;continue;}

            cnt++;

            while(c[i][j]=='*')col[i][j]=cnt,j++;

        }

    }

    bj=cnt;

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

    {

        int i=;

        while(i<=R)

        {

            if(c[i][j]=='.'){i++;continue;}

            cnt++;

            while(c[i][j]=='*')

            {

                if(col[i][j])add(col[i][j],cnt);

                i++;

            }

        }

    }

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

    {

        memset(vis,,sizeof vis);

        if(dfs(i))ans++;

    }

    printf("%d",ans);

    return ;

}