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.*;
public class Main {
 public static void main(String[] args){
	
	 Scanner scan = new Scanner(System.in);
	 
	 int n = scan.nextInt();
	 
	 int x[] = new int[n];
	 int y[] = new int[n];
	 int h[] = new int[n];
	 
	 for(int i=0; i<n; i++){
		 x[i]=scan.nextInt();
		 y[i]=scan.nextInt();
		 h[i]=scan.nextInt();
		 
	 }
	 
	 boolean flag = false;
	 
	 int cx=0;
	 int cy=0;
	 int ch=0;
	 
	 
	
	 for(int X=0; X<101; X++){
		 if(flag == true)break;
		 for(int Y=0; Y<101; Y++){
			 if(flag == true)break;
			 int H=0;
			 
			 for(int i=0;i<n;i++){
			  if(h[i]>0){
				  H=h[i]+Math.abs(x[i]-X)+Math.abs(y[i]-Y);
				  break;
			  }
			  
			 }
			 for(int i=0; i<n; i++){
				
				 if(h[i]!=Math.max(H-Math.abs(x[i]-X)-Math.abs(y[i]-Y),0)){
					 flag=false;
					 break;
				 }else{
					 cx = X;
					 cy = Y;
					 ch = H;
					 flag = true;
				 }
		     }
	     }
	 }
	
	 System.out.println(cx + " " + cy + " "+ ch);
	 
  }
}
