这辈子最讨厌数论，没有之一

// luogu-judger-enable-o2
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int n,m=0,ax[4]={1,-1,0,0},ay[4]={0,0,1,-1},ans=0;
string s;
int p[10000][10000]={0};
void dfs (int x,int y)
{
int nx,ny;
p[x][y]=0;
for(int i=0;i<=4;i++)
{
int nx=x+ax[i],ny=y+ay[i];
if(nx>=0&&nx<=n&&ny>=0&&ny<=m&&p[nx][ny]==1)
dfs(nx,ny);
}
}
int main()
{
cin>>n;
getline (cin,s);
for (int i = 1;i <= n;i++)
{
getline (cin,s);
int l = s.length();
m = max (l , m);
for (int j = 0;j < l;j++)
{
if (s[j] >= 'a' && s[j] <= 'z')
p[i][j] = 1;
}
}
for (int i = 1;i <= n;i++)
{
for (int j = 0;j <= m;j++)
{
if (p[i][j] == 1) dfs(i,j),ans++;
}
}
cout<<ans;
}