#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n = 8;
  vector<string> a(n);
  rep(i,0,n) cin >> a[i];
  vector<int> v(n-1);
  int ok = 0;
  function<void(int)> f = [&](int idx) {
    if (idx == n-1) {
      vector<int> p(n);
      rep(i,0,n-1) {
        rep(j,0,n) {
          p[(v[i]+j)%n] += a[i+1][j]-'0';
        }
      }
      int ng = 0;
      rep(i,0,n) {
        if (p[i] != a[0][i]-'0') ng = 1;
      }
      if (!ng) ok = 1;
      return;
    }
    rep(j,0,n) {
      v[idx] = j;
      f(idx+1);
    }
  };
  f(0);
  if (ok) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}