output_description: 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.
  
  * * *
input_description: 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
attempt: import sys
  import math
  import copy
  import heapq
  from functools import cmp_to_key
  from bisect import bisect_left, bisect_right
  from collections import defaultdict, deque, Counter
  
  # sys.setrecursionlimit(1000000)
  
  # input aliases
  input = sys.stdin.readline
  getS = lambda: input().strip()
  getN = lambda: int(input())
  getList = lambda: list(map(int, input().split()))
  getZList = lambda: [int(x) - 1 for x in input().split()]
  
  INF = float("inf")
  MOD = 10**9 + 7
  divide = lambda x: pow(x, MOD - 2, MOD)
  
  
  def nck(n, k, kaijyo):
      return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD
  
  
  def npk(n, k, kaijyo):
      if k == 0 or k == n:
          return n % MOD
      return (kaijyo[n] * divide(kaijyo[n - k])) % MOD
  
  
  def fact_and_inv(SIZE):
      inv = [0] * SIZE  # inv[j] = j^{-1} mod MOD
      fac = [0] * SIZE  # fac[j] = j! mod MOD
      finv = [0] * SIZE  # finv[j] = (j!)^{-1} mod MOD
      inv[1] = 1
      fac[0] = fac[1] = 1
      finv[0] = finv[1] = 1
      for i in range(2, SIZE):
          inv[i] = MOD - (MOD // i) * inv[MOD % i] % MOD
          fac[i] = fac[i - 1] * i % MOD
          finv[i] = finv[i - 1] * inv[i] % MOD
  
      return fac, finv
  
  
  def renritsu(A, Y):
      # example 2x + y = 3, x + 3y = 4
      # A = [[2,1], [1,3]])
      # Y = [[3],[4]] または [3,4]
      A = np.matrix(A)
      Y = np.matrix(Y)
      Y = np.reshape(Y, (-1, 1))
      X = np.linalg.solve(A, Y)
  
      # [1.0, 1.0]
      return X.flatten().tolist()[0]
  
  
  class TwoDimGrid:
      # 2次元座標 -> 1次元
      def __init__(self, h, w, wall="#"):
          self.h = h
          self.w = w
          self.size = (h + 2) * (w + 2)
          self.wall = wall
          self.get_grid()
          # self.init_cost()
  
      def get_grid(self):
          grid = [self.wall * (self.w + 2)]
          for i in range(self.h):
              grid.append(self.wall + getS() + self.wall)
  
          grid.append(self.wall * (self.w + 2))
          self.grid = grid
  
      def init_cost(self):
          self.cost = [INF] * self.size
  
      def pos(self, x, y):
          # 壁も含めて0-indexed 元々の座標だけ考えると1-indexed
          return y * (self.w + 2) + x
  
      def getgrid(self, x, y):
          return self.grid[y][x]
  
      def get(self, x, y):
          return self.cost[self.pos(x, y)]
  
      def set(self, x, y, v):
          self.cost[self.pos(x, y)] = v
          return
  
      def show(self):
          for i in range(self.h + 2):
              print(self.cost[(self.w + 2) * i : (self.w + 2) * (i + 1)])
  
      def showsome(self, tgt):
          for t in tgt:
              print(t)
          return
  
      def showsomejoin(self, tgt):
          for t in tgt:
              print("".join(t))
          return
  
      def search(self):
          grid = self.grid
          move = [(0, 1), (0, -1), (1, 0), (-1, 0)]
          move_eight = [
              (0, 1),
              (0, -1),
              (1, 0),
              (-1, 0),
              (1, 1),
              (1, -1),
              (-1, 1),
              (-1, -1),
          ]
          # for i in range(1, self.h+1):
          #     for j in range(1, self.w+1):
          #         cx, cy = j, i
          #         for dx, dy in move_eight:
          #             nx, ny = dx + cx, dy + cy
  
  
  def judge(id, sho, n):
      hito = [0]
      for i in range(n):
          if id % 2 == 1:
              hito.append(1)
          else:
              hito.append(0)
          id //= 2
  
      for i, h in enumerate(hito):
          if i == 0:
              continue
          if h == 1:
              for x, y in sho[i - 1]:
                  if hito[x] != y:
                      return -1
  
      return sum(hito)
  
  
  def solve():
      n = getN()
      q = []
      for i in range(n):
          q.append(getList())
  
      for i in range(0, 101):
          for j in range(0, 101):
              ch = -1
              ok = True
              fzero = False
              for x, y, h in q:
                  ins = h + abs(x - i) + abs(y - j)
                  if ch == -1:
                      ch = ins
                      if h == 0:
                          fzero = True
                  else:
                      if ch != ins:
                          if fzero:
                              if h == 0:
                                  if ins < ch:
                                      ch = ins
                              else:
                                  if ins > ch:
                                      ok = False
                                      break
                                  ch = ins
                              fzero = h == 0
                          elif h != 0:
                              ok = False
                              break
              if ok:
                  print(i, j, ch)
                  return
  
  
  def main():
      n = getN()
      for _ in range(n):
          solve()
  
      return
  
  
  if __name__ == "__main__":
      # main()
      solve()
  
problem_description: Statement
  
  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.
samples: [{"input": "4\n    2 3 5\n    2 1 5\n    1 2 5\n    3 2 5", "output": "2 2 6\n    \n\nIn this case, the center coordinates and the height can be identified as (2,\n2) and 6.\n\n* * *"}, {"input": "2\n    0 0 100\n    1 1 98", "output": "0 0 100\n    \n\nIn this case, the center coordinates and the height can be identified as (0,\n0) and 100.  \nNote that C_X and C_Y are known to be integers between 0 and 100.\n\n* * *"}, {"input": "3\n    99 1 191\n    100 1 192\n    99 0 192", "output": "100 0 193\n    \n\nIn this case, the center coordinates and the height can be identified as (100,\n0) and 193."}]