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) {

        // read n
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        // read coords
        LinkedList<Coord> nzlist = new LinkedList<Coord>();
        LinkedList<Coord>  zlist = new LinkedList<Coord>();

        for (int i = 0; i < n; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int h = sc.nextInt();
            if (h != 0){
                nzlist.add(new Coord(x,y,h));
            } else {
                 zlist.add(new Coord(x,y,h));
            }
        }

        LinkedList<Coord> alllist = (LinkedList<Coord>) nzlist.clone();
        alllist.addAll(zlist);

        // 1 <= N <= 100 なので nzlist は empty でない


        // search
        boolean okFlag = false;
        Coord center = new Coord(-1,-1,-1);
        for (int x=0; x<=100; x++) {
            for (int y = 0; y<=100; y++) {
                // h-coord: (x,y)
                Coord c = nzlist.get(0); // Warning: unchecked
                int h = c.h+Math.abs(c.x-x)+Math.abs(c.y-y);
                center = new Coord(x,y,h);

                okFlag = true;
                for (Coord e : alllist){
                    if (e.h != Math.max(h-Math.abs(x-e.x)-Math.abs(y-e.y), 0)){
                        okFlag = false;
                        break;
                    }
                }
                if(okFlag){break;}
            }
            if(okFlag){break;}
        }

        System.out.print(center.show()+"\n");
    }


}


class Coord{

    public int x;
    public int y;
    public int h;

    Coord(int x, int y, int h){
        this.x = x;
        this.y = y;
        this.h = h;
    }

    public String show(){
        return String.valueOf(x)+' '+String.valueOf(y)+' '+String.valueOf(h);
    }

}

