// compile: g++ -o data data.cpp -std=gnu++20 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#endif
#define sz(v) ((int)(v).size())
#define PV(v) for (int i=0;i<v.size();++i)cout<<v[i]<<" ";cout<<endl;
#define INTINF 9223372036854775807
#define int long long

using namespace std;

int n = 8;
bool valid[10][10];
int a[10];
int total = 0;
int col[10];

void check() {
    for (int i = 0; i < n; ++i) {
        // i, a[i]
        for (int j = i + 1; j < n; ++j) {
            // j, a[j]
            if (abs(i-j) == abs(a[i]-a[j])) return;
        }
    }
    ++total;
    // for (int i = 0; i < n; ++i) {
    //     for (int j = 0; j < n; ++j) {
    //         if (a[i] == j) cout << '#';
    //         else cout << '.';
    //     }
    //     cout << endl;
    // }
}

void dfs(int k) {
    if (k >= n) {
        check();
        return;
    }
    for (int i = 0; i < n; ++i) {
        if (!valid[k][i] || col[i]) continue;
        col[i] = 1;
        a[k] = i;
        dfs(k + 1);
        col[i] = 0;
    }
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    for (int i = 0; i < n; ++i) {
        string s; cin >> s;
        for (int j = 0; j < n; ++j) valid[i][j] = s[j] == '.';
    }
    memset(col, 0, sizeof(col));
    dfs(0);
    cout << total << endl;

    return 0;
}