/**
	author:  shobonvip
	created: 2025.08.16 17:10:49
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	vector<vector<int>> a(8,vector<int>(8));
	rep(i,0,8){
		rep(j,0,8){
			char c;cin>>c;
			a[i][j]=c-'0';
		}
	}

	bool mode=0;
	vector<int> b = a[0];
	auto dfs=[&](auto self, int i) -> void {
		if(i==8){
			if(max(b)==0&&min(b)==0)mode=1;
			return;
		}

		rep(j,0,8){
			rep(k,0,8){
				b[(j+k)%8]-=a[i][k];
			}
			self(self,i+1);
			rep(k,0,8){
				b[(j+k)%8]+=a[i][k];
			}
		}
	};

	dfs(dfs,1);

	if(mode)cout<<"Yes\n";
	else cout<<"No\n";
}