#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) {
      res = res * t;
    }
    t = t * t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

i64 a[8][8];
bool solve(vector<i64> &v) {
  if (v.size() == 7) {
    vector<i64> p(8);
    for (i64 i = 0; i < 8; i++) p[i] = a[0][i];
    for (i64 i = 1; i < 8; i++) {
      vector<i64> np(8);
      for (i64 j = 0; j < 8; j++) {
        np[j] = p[(j + v[i - 1]) % 8];
      }
      swap(p, np);
      for (i64 j = 0; j < 8; j++) {
        p[j] -= a[i][j];
      }
    }
    bool ok = true;
    for (i64 i = 0; i < 8; i++) ok &= p[i] == 0;
    return ok;
  }
  for (i64 i = 0; i < 8; i++) {
    v.push_back(i);
    if (solve(v)) {
      return true;
    }
    v.pop_back();
  }
  return false;
}
void _main() {
  for (i64 i = 0; i < 8; i++) {
    string s;
    cin >> s;
    for (i64 j = 0; j < 8; j++) {
      a[i][j] = s[j] - '0';
    }
  }
  vector<i64> v;
  if (solve(v)) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
}