Problem:
Score: 300 points

Problem Statement

In the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.

The pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).

Aoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:

C_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.

Additionally, he obtained N pieces of information. The i-th of them is: "the altitude of point (x_i, y_i) is h_i."

This was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.

Constraints

N is an integer between 1 and 100 (inclusive).

x_i and y_i are integers between 0 and 100 (inclusive).

h_i is an integer between 0 and 10^9 (inclusive).

The N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.

The center coordinates and the height of the pyramid can be uniquely identified.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1 h_1
x_2 y_2 h_2
x_3 y_3 h_3
:
x_N y_N h_N

Output

Print values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.

Sample Input 1

4
2 3 5
2 1 5
1 2 5
3 2 5

Sample Output 1

2 2 6

In this case, the center coordinates and the height can be identified as (2, 2) and 6.

Sample Input 2

2
0 0 100
1 1 98

Sample Output 2

0 0 100

In this case, the center coordinates and the height can be identified as (0, 0) and 100.

Note that C_X and C_Y are known to be integers between 0 and 100.

Sample Input 3

3
99 1 191
100 1 192
99 0 192

Sample Output 3

100 0 193

In this case, the center coordinates and the height can be identified as (100, 0) and 193.

Solution in Rust (1.15.1) (judge verdict: Accepted)

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

pub 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")
}

use std::cmp::max;

fn main() {
    let n: usize = read();
    let mut hint: Vec<(i64, i64, i64)> = vec![];
    let mut s = 0;

    for _ in 0..n {
        let x: i64 = read();
        let y: i64 = read();
        let h: i64 = read();
        hint.push((x, y, h));
    }

    for i in 0..hint.len() {
        let hi = hint[i];
        if hi.2 != 0 {
            s = i;
            break;
        }
    }

    for x in 0..101 {
        for y in 0..101 {
            let h = hint[s].2 + (hint[s].0 - x).abs() + (hint[s].1 - y).abs();
            let mut f = true;

            for p in &hint {
                let px = p.0;
                let py = p.1;
                let ph = p.2;
                let ti = h - (x - px).abs() - (y - py).abs();

                if max(ti, 0) != ph {
                    f = false;
                    break;
                }
            }
            if f {
                println!("{} {} {}", x, y, h);
                return;
            }
        }
    }
    //
    // for h in 0..101 {
    //     for w in 0..101 {
    //         let top = hint[s].2 + (w - hint[s].0).abs() + (h - hint[s].1).abs();
    //         if top < 0 {
    //             continue;
    //         }
    //         let mut all = true;
    //         for i in 0..hint.len() {
    //             let hi = hint[i];
    //             let ti = hi.2 + (w - hi.0).abs() + (h - hi.1).abs();
    //             if ti != top {
    //                 all = false;
    //                 break;
    //             }
    //         }
    //
    //         if all {
    //             println!("{} {} {}", w, h, top);
    //             return;
    //         }
    //     }
    // }
}