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.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[][] obs = new int[N][3];
		for (int i = 0; i < N; ++i) {
			obs[i][0] = sc.nextInt();
			obs[i][1] = sc.nextInt();
			obs[i][2] = sc.nextInt();
		}
		sc.close();

		int firstNonZero = 0;
		int minX = obs[0][0], maxX = obs[0][0];
		int minY = obs[0][1], maxY = obs[0][1];
		for (int i = 1; i < N; ++i) {
			if(obs[0][2] == 0 && obs[i][2] != 0 && firstNonZero == 0)
				firstNonZero = i;
			if (minX > obs[i][0])
				minX = obs[i][0];
			else if (maxX < obs[i][0])
				maxX = obs[i][0];
			if (minY > obs[i][1])
				minY = obs[i][1];
			else if (maxY < obs[i][1])
				maxY = obs[i][1];
		}

		int[] ans = new int[3];
		for (int x = minX; x <= maxX; ++x) {
			for (int y = minY; y <= maxY; ++y) {
				int h = Math.abs(obs[firstNonZero][0] - x) + Math.abs(obs[firstNonZero][1] - y) + obs[firstNonZero][2];
				boolean flag = true;
				for (int i = 0; i < N; ++i) {
					int tmpH = Math.max(h - Math.abs(obs[i][0] - x) - Math.abs(obs[i][1] - y), 0);
					if (tmpH != obs[i][2]) {
						flag = false;
						break;
					}
				}
				if (flag) {
					ans[0] = x;
					ans[1] = y;
					ans[2] = h;
					break;
				}
			}
		}

		System.out.println(String.format("%d %d %d", ans[0], ans[1], ans[2]));
	}
}
