#include<bits/stdc++.h>
using namespace std;
int sum;
int n,m,vis[1005][1005];
char a[1005][1005];
void dfs(int x,int y){	
	if(x<1||x>n||y<1||y>n||a[x][y]!='#'||vis[x][y]==1){
	return;
	}
	vis[x][y]=1;
	dfs(x+1,y);
	dfs(x-1,y);
	dfs(x,y+1);
	dfs(x,y-1);
}
int main(){
	memset(vis,0,sizeof(vis)); 
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	 for(int j=1;j<=m;j++)
	 cin>>a[i][j];
	 sum=0;
	for(int i=1;i<=n;i++)
	 for(int j=1;j<=m;j++){
	   if(vis[i][j]==0&&a[i][j]=='#'){
	    dfs(i,j);
		sum++;
		}
	 }
	 if(sum!=0) 
	 printf("There are %d ships\n",sum);
	 else 
	 printf("Bad placement\n");
}