#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }


void solve() {
    ll N=8;
    vector<vector<ll>> A(N,vector<ll> (N,0));
    rep(i,N){
        string S;
        cin>>S;
        rep(j,N){
            A[i][j]=S[j]-'0';
        }
    }
    bool flag=false;
    auto dfs=[&](auto self,ll i)->void {
        if (i==N){
            if (count(all(A[0]),0)==N){
                flag=true;
            }
            return;
        }
        rep(j,N){
            rep(k,N){
                A[0][k]-=A[i][(k+j)%N];
            }
            self(self,i+1);
            rep(k,N){
                A[0][k]+=A[i][(k+j)%N];
            }
        }
        return;
    };
    dfs(dfs,1);
    if (flag){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}