Problem:
Score: 300 points

Problem Statement

We have a 3 \times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.

According to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j.

Determine if he is correct.

Constraints

c_{i, j} \ (1 \leq i \leq 3, 1 \leq j \leq 3) is an integer between 0 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

c_{1,1} c_{1,2} c_{1,3}
c_{2,1} c_{2,2} c_{2,3}
c_{3,1} c_{3,2} c_{3,3}

Output

If Takahashi's statement is correct, print Yes; otherwise, print No.

Sample Input 1

1 0 1
2 1 2
1 0 1

Sample Output 1

Yes

Takahashi is correct, since there are possible sets of integers such as: a_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.

Sample Input 2

2 2 2
2 1 2
2 2 2

Sample Output 2

No

Takahashi is incorrect in this case.

Sample Input 3

0 8 8
0 8 8
0 8 8

Sample Output 3

Yes

Sample Input 4

1 8 6
2 9 7
0 7 7

Sample Output 4

No

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::*;
use std::str::FromStr;

fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char) 
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main() {
    let c_ij: Vec<i32> = (0..9).map(|_| read()).collect();
    // println!("{:?}", c_ij);

    let mut ai: Vec<i32> = vec![-1; 3];
    let mut bj: Vec<i32> = vec![-1; 3];

    let mut min = c_ij[0];
    let mut argmin = 0;
    for i in 0..9 {
        if c_ij[i] < min {
            min = c_ij[i];
            argmin = i;
        }
    }

    // println!("{}", argmin);
    // println!("{}", min);

    let i = argmin % 3;
    let j = argmin / 3;
    ai[i] = 0;
    bj[j] = 0;

    for n in 0..9 {
        let i = n % 3;
        let j = n / 3;
        if ai[i] == -1 && bj[j] != -1 {
            ai[i] = c_ij[n] - bj[j];
        }
        if ai[i] != -1 && bj[j] == -1 {
            bj[j] = c_ij[n] - ai[i];
        }
    }

    // println!("{:?}", ai);
    // println!("{:?}", bj);

    let mut ans = "Yes";
    for n in 0..9 {
        let i = n % 3;
        let j = n / 3;
        if ai[i] + bj[j] != c_ij[n] {
            ans = "No";
            break;
        }
    }

    println!("{}", ans);
}