#include<bits/stdc++.h>
using namespace std;
char a[1005][1005];
int n,m,ans;
bool vis[1005][1005];
int tx[4]={-1,1,0,0};
int ty[4]={0,0,-1,1};
void dfs(int x,int y){
	vis[x][y]=1;
	for(int i=0;i<4;i++){
		int nx=x+tx[i];
		int ny=y+ty[i];
		if(a[nx][ny]=='.'||vis[nx][ny]==1){
			continue;
		}
		dfs(nx,ny);
	}
}
int main(){
	memset(a,'.',sizeof(a));
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	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);
				ans++;
			}
		}
	}
	if(ans>1){
		cout<<"There are "<<ans<<" ships.";
	}
	else if(ans==0){
		cout<<"Bad placement.";
	}
	else{
		cout<<"There are "<<ans<<" ship.";
	}
	return 0;
}