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.

Examples

Input

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


Output

2 2 6


Input

2
0 0 100
1 1 98


Output

0 0 100


Input

3
99 1 191
100 1 192
99 0 192


Output

100 0 193
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author naruse
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Pyramid solver = new Pyramid();
        solver.solve(1, in, out);
        out.close();
    }

    static class Pyramid {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int x[] = new int[n];
            int y[] = new int[n];
            int h[] = new int[n];
            int sx = 0, sy = 0, sh = 0;
            for (int i = 0; i < n; i++) {
                x[i] = in.nextInt();
                y[i] = in.nextInt();
                h[i] = in.nextInt();
                if (h[i] > 0) {
                    sx = x[i];
                    sy = y[i];
                    sh = h[i];
                }
            }
            for (int i = 0; i < 101; i++) {
                for (int j = 0; j < 101; j++) {
                    int nowh = Math.max(sh + Math.abs(i - sx) + Math.abs(j - sy), 0);
                    boolean ok = (nowh > 0);
                    for (int k = 0; k < n; k++) {
                        int checkh = Math.max(h[k] + Math.abs(i - x[k]) + Math.abs(j - y[k]), 0);
                        if (nowh != checkh) {
                            if (h[k] == 0 && checkh >= nowh) continue;
                            ok = false;
                        }
                    }
                    if (ok) {
                        out.println(i + " " + j + " " + nowh);
                        return;
                    }
                }
            }
        }

    }
}

