#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	vector a(8, vector<int>(8));
	rep(i, 8) {
		string s; cin >> s;
		rep(j, 8)a[i][j] = s[j] - '0';
	}
	auto a0 = a[0];
	bool chk = false;
	auto dfs = [&](auto &&self, int d)->void {
		if (d == 8) {
			bool sub = true;
			rep(i, 8)if (a0[i] != 0)sub = false;
			if (sub)chk = true;
			return;
		}
		rep(i, 8) {
			rep(j, 8) {
				int j2 = (i + j) % 8;
				a0[j2] -= a[d][j];
			}
			self(self, d + 1);
			rep(j, 8) {
				int j2 = (i + j) % 8;
				a0[j2] += a[d][j];
			}
		}
	};
	dfs(dfs, 1);
	if (chk)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}