#include <iostream>
#include <cmath>
using namespace std;
int x[102],y[102],h[102];
int c_x,c_y,c_h;
int max_h;
int main()
{
	int n;
	scanf("%d",&n);
	max_h = -1;
	for(int i = 1;i <= n;i ++)
	{
		scanf("%d%d%d",x + i,y + i,h + i);
		max_h = max(max_h,h[i]);
	}
	int sign = 1;
	for(c_h = max_h;sign;c_h ++)
		for(c_x = 0;sign && c_x <= 100;c_x ++)
			for(c_y = 0;sign && c_y <= 100;c_y ++)
			{
				int i = 1;
				for(;i <= n;i ++)
					if(h[i] != max(0,(c_h - abs(c_x - x[i]) - abs(c_y - y[i]))))
						break;
				if(i > n)
					sign = 0;
			}
	printf("%d %d %d\n",c_x - 1,c_y - 1,c_h - 1);
	return 0;
}
### Prompt

Your task is to create a Cpp solution to the following problem:

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

### Response

```cpp
#include <iostream>
#include <cmath>
using namespace std;
int x[102],y[102],h[102];
int c_x,c_y,c_h;
int max_h;
int main()
{
	int n;
	scanf("%d",&n);
	max_h = -1;
	for(int i = 1;i <= n;i ++)
	{
		scanf("%d%d%d",x + i,y + i,h + i);
		max_h = max(max_h,h[i]);
	}
	int sign = 1;
	for(c_h = max_h;sign;c_h ++)
		for(c_x = 0;sign && c_x <= 100;c_x ++)
			for(c_y = 0;sign && c_y <= 100;c_y ++)
			{
				int i = 1;
				for(;i <= n;i ++)
					if(h[i] != max(0,(c_h - abs(c_x - x[i]) - abs(c_y - y[i]))))
						break;
				if(i > n)
					sign = 0;
			}
	printf("%d %d %d\n",c_x - 1,c_y - 1,c_h - 1);
	return 0;
}
```