#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



int main() {

	//clock_t start, end;
	//start = clock();

	vector<vector<int>> C(3, vector<int>(3));
	cin >> C;

	for (int a0 = 0; a0 <= C[0][0]; a0++) {
		int b0 = C[0][0] - a0;
		vector<vector<int>> D(C);
		bool flag = true;
		REP(i, 3) {
			D[i][0] -= b0;
			if (D[i][0] < 0) {
				flag = false;
				break;
			}
		}
		if (!flag) continue;
		REP(j, 3) {
			D[0][j] -= a0;
			if (D[0][j] < 0) {
				flag = false;
				break;
			}
		}
		if (!flag) continue;

		for (int a1 = 0; a1 <= D[1][1]; a1++) {
			int b1 = D[1][1] - a1;
			vector<vector<int>> E(D);
			bool flag2 = true;
			REP(i, 3) {
				E[i][1] -= b1;
				if (E[i][1] < 0) {
					flag2 = false;
					break;
				}
			}
			if (!flag2) continue;
			REP(j, 3) {
				E[1][j] -= a1;
				if (E[1][j] < 0) {
					flag2 = false;
					break;
				}
			}
			if (!flag2) continue;

			for (int a2 = 0; a2 <= E[2][2]; a2++) {
				int b2 = E[2][2] - a2;
				vector<vector<int>> F(E);
				bool flag3 = true;
				REP(i, 3) {
					F[i][2] -= b2;
					if (F[i][2] < 0) {
						flag3 = false;
						break;
					}
				}
				if (!flag3) continue;
				REP(j, 3) {
					F[2][j] -= a2;
					if (F[2][j] < 0) {
						flag3 = false;
						break;
					}
				}
				if (!flag3) continue;

				int sum = 0;
				REP(i, 3) REP(j, 3) {
					sum += F[i][j];
				}
				if (sum == 0) {
					cout << "Yes" << endl;
					return 0;
				}
			}
		}
	}
	cout << "No" << endl;


	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}




Measured memory_bytes: 256