import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto S = new string[](N);
    foreach (i; 0 .. N)
        S[i] = sread();

    long ans;
    outer: foreach (i; 0 .. N)
    {
        foreach (j; 0 .. N)
            foreach (k; 0 .. N)
            {
                if (S[(j + i) % N][k] != S[(k + i) % N][j])
                {
                    // writefln("%s %s %s %s %s", i, j, k, S[(j + i) % N][k], S[k][(j + i) % N]);
                    continue outer;
                }
            }
        ans += N;
    }
    writeln(ans);
}
