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.*;
	import java.util.Map.Entry;
	 
	 
	 class Main {
		 static int mod =  (int) (Math.pow(10,9)+7);
//		 static int mod =  (int) 998244353;
		 static List<ArrayList<Integer>>  list = new ArrayList<ArrayList<Integer>>();
	    public static void main(String[] args) {
	    	
	        Scanner sc = new Scanner(System.in);
	        int N = sc.nextInt();	
	        int[][] x = new int[N][3];
	        for (int i=0 ; i<N; i++) {
	            x[i][0] = Integer.parseInt(sc.next());
	            x[i][1] = Integer.parseInt(sc.next());
	            x[i][2] = Integer.parseInt(sc.next());
	        }
	        Arrays.sort(x, (b, c) -> Integer.compare(c[2], b[2]));
	        
	        for(int i=0;i<101;i++) {
	        	for(int j=0;j<101;j++) {
	        		long ans=x[0][2]+Math.abs(x[0][0]-i)+Math.abs(x[0][1]-j);
	        		boolean flg=true;
	        		for(int k=1;k<N;k++) {
	        			if(ans!=x[k][2]+Math.abs(x[k][0]-i)+Math.abs(x[k][1]-j)) {
	        				if(x[k][2]==0&&Math.abs(x[k][0]-i)+Math.abs(x[k][1]-j)>=ans)continue;
	        				flg=false;
	        				break;
	        			}
	        		}
	        		if(flg==true) {
	        			System.out.print(i);
	        			System.out.print(" ");
	        			System.out.print(j);
	        			System.out.print(" ");
	        			System.out.println(ans);
	        			return;
	        		}
	        	}
	        }

	        

	        
	        

	    }
	    
	    

	}