import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

int[] di = [1, 1, -1, -1];
int[] dj = [1, -1, 1, -1];

void main() {
    int n;
    scan(n);
    auto m = iota(n).map!(i => readln.chomp).array;
    int ans;

    foreach (i ; 1 .. n - 1) {
        foreach (j ; 1 .. n - 1) {
            if (m[i][j] != 'X') continue;
            bool ok = true;
            foreach (k ; 0 .. 4) {
                int ni = i + di[k];
                int nj = j + dj[k];
                if (m[ni][nj] != 'X') {
                    ok = false;
                    break;
                }
            }
            ans += ok;
        }
    }

    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
