#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
vvi a(8, vi(8)); 
bool ans = false;

void dfs(vector<int> &v){
    if(ans)return;
    if(v.size() == 7){
        vi minus(8, 0);
        rep(i, 7){
            rep(j, 8)minus[j] += a[i+1][(j+v[i])%8];
        }
        bool f = true;
        rep(i, 8){
            if(a[0][i] != minus[i]){
                f = false;
                break;
            }
        }
        if(f){
            ans = true;
        }
    }else{
        rep(i, 8){
            v.push_back(i);
            dfs(v);
            v.pop_back();
        }
    }

}


int main(){
    vector<string> vs(8); rep(i, 8)cin >> vs[i];
    rep(i, 8)rep(j, 8)a[i][j] = vs[i][j] - '0';
    vector<int> v;
    dfs(v);
    cout << (ans ? "Yes" : "No") << endl;

    return 0;
}