#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
char g[N][N];
int n;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
void dfs(int x, int y)
{
g[x][y] = '.';
for (int i = 0; i < 4; i ++ )
{
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < n && g[a][b] == '*')
{
dfs(a, b);
}
}
}
int main()
{
cin >> n;
int res = 0;
for (int i = 0; i < n; i ++ )
{
for (int j = 0; j < n; j ++ )
{
cin >> g[i][j];
}
}
for (int i = 0; i < n; i ++ )
{
for (int j = 0; j < n; j ++ )
{
if (g[i][j] == '*')
{
dfs(i, j);
res ++ ;
}
}
}
cout << res << endl;
return 0;
}