#include <bits/stdc++.h>
using namespace std;
int a[10][10], k, n, b[10][10], c[10][10], d[10][10];
int ans = 0;

int main() {
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			cin >> a[i][j];
			b[i][j] = a[i][j];
			c[i][j] = a[i][j];
			d[i][j] = a[i][j];
		}
	}
	//-------------------------------------
	for (int i = 1; i <= 9; i++) {
		int a1[10];
		for (int j = 1; j <= 9; j++) {
			a1[i] = a[i][j];
		}
		sort(a1, a1 + 9);
		for (int j = 1; j <= 9; j++) {
			if (a1[i] == i) {
				ans++;
			}
		}
	}
	//-------------------------------------
	for (int i = 1; i <= 9; i++) {
		int a1[10];
		for (int j = 1; j <= 9; j++) {
			a1[i] = a[j][i];
		}
		sort(a1, a1 + 9);
		for (int j = 1; j <= 9; j++) {
			if (a1[i] == i) {
				ans++;
			}
		}
	}
	//-------------------------------------
	for (int i = 1; i <= 9; i += 3) {
		int a1[10];
		a1[1] = a[(i - 2)][(i - 2)];
		a1[2] = a[(i - 2)][(i - 1)];
		a1[3] = a[(i - 2)][i];
		a1[4] = a[(i - 1)][(i - 2)];
		a1[5] = a[(i - 1)][(i - 1)];
		a1[6] = a[(i - 1)][i];
		a1[7] = a[i][(i - 2)];
		a1[8] = a[i][(i - 1)];
		a1[9] = a[i][i];
		sort(a1, a1 + 9);
		for (int j = 1; j <= 9; j++) {
			if (a1[i] == i) {
				ans++;
			}
		}
	}
	if (ans == 27) {
		cout << "Yes";
	} else {
		cout << "No";
	}
	return 0;
}

对了19个点，错了12个点