#include <fstream>
#include <algorithm>
using namespace std;

int n, i, j, m, maxim, v[700002], p, sol, lin[100];
int di[] = {1, 1, 1, -1, -1, -1, 0, 0};
int dj[] = {-1, 0, 1, -1, 0, 1, 1, -1};

ifstream fin("livada.in");
ofstream fout("livada.out");

int main(){
    for(i=1;i<=8;i++)
        for(j=1;j<=8;j++){
            fin>>x;
            v[i][j]=x-'0';
            if(v[i][j]==0){
                lib[++nr].l=i;
                lib[nr].c=j;
            }
        }
    for(i=1;i<=nr;i++){
        st=lib[i].l;
        dr=lib[i].c;
        while(p<=u){
            ic=lib[i].l;
            jc=lib[i].c;
            for(j=0;j<7;j++){
                im=ic+di[j];
                jm=dj+dj[j];
            }
        }
    }
    return 0;
}