#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;

const int MAX = 8;
int solutions=0;
bool visitedCol[MAX], rightDia[2*MAX+1],leftDia[2*MAX+1],available[MAX][MAX];

void Queens(int w){
    if (w == 8){
        solutions++;
        return;
    }
    for (int k = 0;k <8;k++){
        if(!visitedCol[k]&&!rightDia[k+w]&&!leftDia[MAX+k-w]&&!available[w][k]){
            visitedCol[k] = rightDia[k+w] = leftDia[MAX+k-w] = 1;
            Queens(w+1);
            visitedCol[k] = rightDia[k+w] = leftDia[MAX+k-w] = 0;
        }
    }



}

int main() {
    FAST
    char c;
    for (int i = 0;i<8;i++){
        for (int j = 0;j<8;j++){
            cin >> c;
            if (c == '*'){
                available[i][j]=1;
            }
        }
    }
    Queens(0);

    cout << solutions << "\n";
    //system("pause");
    return 0;
}