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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;


void solve();

int main(){
  int T=1;
  rep(T)solve();
}

void solve(){
  const int N=8;
  vector<string> A(N);
  rep(i,N)cin>>A[i];
  fore(i,A){
    fore(j,i)j-='0';
  }
  auto dfs=[&](auto f,int n,vi s) -> bool {
    if(n==8){
      rep(i,N){
        if(s[i]!=A[0][i])return false;
      }
      return true;
    }
    bool ret=0;
    rep(x,8){
      vi s2=s;
      rep(i,8){
        s2[i]+=A[n][(i+x)%N];
      }
      bool ok=1;
      rep(i,8){
        if(s2[i]>A[0][i])ok=0;
      }
      if(ok)ret|=f(f,n+1,s2);
    }
    return ret;
  };
  cout<<(dfs(dfs,1,vi(N))?"Yes\n":"No\n");
}