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
*/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);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int po[][] = new int[2][N];
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            po[0][i] = in.nextInt();
            po[1][i] = in.nextInt();
            h[i] = in.nextInt();
        }
        for(int cx = 0; cx<=100; cx++){
            loop:for(int cy = 0; cy<=100; cy++){
                int H = 0;
                int maxh = 1<<30;
                for(int i = 0; i<N; i++){
                    if(h[i] == 0) {
                        maxh = Math.min(maxh, Math.abs(po[0][i] - cx) + Math.abs(po[1][i] - cy));
                        continue;
                    }
                    if(H == 0) H = h[i] + Math.abs(po[0][i] - cx) + Math.abs(po[1][i] - cy);
                    if(h[i] + Math.abs(po[0][i] - cx) + Math.abs(po[1][i] - cy) != H) continue loop;
                }
                if(maxh >= H) out.println(cx+" "+cy+" "+H);
            }
        }
        
    }

}
}

