#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 200 + 10;
const int X[] = {0, 0, -1, 1};
const int Y[] = {-1, 1, 0, 0};
int n, m, s;
char c[N][N];
bool v[N][N];
void DFS(int x, int y) {
    if(x < 0 || y < 0 || x >= n || y >= m) return;
    if(v[x][y] || !('a' <= c[x][y] && c[x][y] <= 'z')) return;
    v[x][y] = 1;
    for(int k=0; k<4; k++)
        DFS(x + X[k], y + Y[k]);
}
int main() {
    freopen("family.in", "r", stdin);
    freopen("family.out", "w", stdout);
    scanf("%d", &n);
    for(int i=0; i<n; i++) {
        gets(c[i]);
        m = max(m, (int) strlen(c[i]));
    }
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            if('a' <= c[i][j] && c[i][j] <= 'z')
                if(!v[i][j]) { s++; DFS(i, j); }
    printf("%d\n", s);
    return 0;
}