#include <bits/stdc++.h>
using namespace std;
bool isValidSudoku3x3(vector<vector<int>> &grid) {
unordered_set<int> seen;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (grid[i][j] < 1 || grid[i][j] > 9) return false; // Check range
if (seen.count(grid[i][j])) return false; // Check duplicates
seen.insert(grid[i][j]);
}
}
return true;
}
int main() {
vector<vector<int>> grid(3, vector<int>(3));
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
cin >> grid[i][j];
cout << (isValidSudoku3x3(grid) ? "false" : "true") << endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpib29sIGlzVmFsaWRTdWRva3UzeDModmVjdG9yPHZlY3RvcjxpbnQ+PiAmZ3JpZCkgewogICAgdW5vcmRlcmVkX3NldDxpbnQ+IHNlZW47CiAgICBmb3IgKGludCBpID0gMDsgaSA8IDM7IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgMzsgaisrKSB7CiAgICAgICAgICAgIGlmIChncmlkW2ldW2pdIDwgMSB8fCBncmlkW2ldW2pdID4gOSkgcmV0dXJuIGZhbHNlOyAvLyBDaGVjayByYW5nZQogICAgICAgICAgICBpZiAoc2Vlbi5jb3VudChncmlkW2ldW2pdKSkgcmV0dXJuIGZhbHNlOyAvLyBDaGVjayBkdXBsaWNhdGVzCiAgICAgICAgICAgIHNlZW4uaW5zZXJ0KGdyaWRbaV1bal0pOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiB0cnVlOwp9CgppbnQgbWFpbigpIHsKICAgIHZlY3Rvcjx2ZWN0b3I8aW50Pj4gZ3JpZCgzLCB2ZWN0b3I8aW50PigzKSk7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IDM7IGkrKykKICAgICAgICBmb3IgKGludCBqID0gMDsgaiA8IDM7IGorKykKICAgICAgICAgICAgY2luID4+IGdyaWRbaV1bal07CgogICAgY291dCA8PCAoaXNWYWxpZFN1ZG9rdTN4MyhncmlkKSA/ICJmYWxzZSIgOiAidHJ1ZSIpIDw8IGVuZGw7CiAgICByZXR1cm4gMDsKfQo=
W1sxLDAsMl0sCls0LDIsNl0sCls3LDgsOV1d
[[1,0,2],
[4,2,6],
[7,8,9]]