#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define inf (long long int) 1e18
#define eps 0.000001
#define vl vector<ll> 
#define sl set<ll>
#define pll pair<ll, ll>
#define mll map<ll, ll> 
#define mod 1000000007
#define MAXN 100001
ll spf[MAXN]; 
ll gcd(ll a,ll b);
ll palindrome(string s);
ll modexp(ll a,ll b,ll m);
void sieve();
ll ceil(ll a, ll b);
vl getFactorization(ll x);
void getZarr(string str, ll Z[]);


int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/

    ll n;
    cin>>n;
    ll x[n],y[n],h[n];
    loop(i,0,n) cin>>x[i]>>y[i]>>h[i];
    ll CX,CY,HT;
    bool found=false;
    bool allze=true;
    loop(i,0,n){
        if(h[i]!=0){
            allze=false;
        }
    }
    if(allze==true){
        for(ll i=0;i<=100 && found==false;i++){
            for(ll j=0;j<=100 && found==false;j++){
                ll cx=i,cy=j,H=INT_MAX;
                loop(k,0,n){
                    H=min(abs(cx-x[k])+abs(y[k]-cy),H);
                }
                if(H==2){
                    CX=cx;
                    CY=cy;
                    HT=1;
                    found=true;
                }
            }
        }
        cout<<CX<<" "<<CY<<" "<<HT<<endl;
    }
    if(allze==false){
        for(ll i=0;i<=100 && found==false;i++){
            for(ll j=0;j<=100 && found==false;j++){
                ll cx=i,cy=j,H;
                for(ll k=0;k<n; k++){
                    if(h[k]!=0){
                        H=h[k]+abs(x[k]-cx)+abs(y[k]-cy);
                    }
                }
                bool done=true;
                for(ll k=0;k<n && done==true;k++){
                    if(h[k]>0){
                        ll hgt=h[k]+abs(x[k]-cx)+abs(y[k]-cy);
                        if(hgt!=H){
                            done=false;
                        }
                    }
                    else if(h[k]==0){
                        ll hgt=abs(x[k]-cx)+abs(y[k]-cy);
                        if(H>hgt){
                            done=false;
                        }
                    }
                }
                if(done==true){
                    CX=cx;
                    CY=cy;
                    HT=H;
                    found=true;
                }
            }
        }
        cout<<CX<<" "<<CY<<" "<<HT<<endl;
    }
    
    
}

ll gcd(ll a, ll b){
    if (a == 0)   return b;
    if(b==0)      return a;
    if (a == b)   return a;
    if (a > b)    return gcd(a%b, b);
    return gcd(a, b%a);
}

ll palindrome(string s){
    ll l = 0;
    ll h = s.length() - 1;
    while (h > l){
        if (s[l++] != s[h--]){
            return 0;
        }
    }
    return 1;
}

ll modexp(ll a, ll b, ll m){
    if (b==0)
        return 1;
    ll temp = modexp(a,b/2,m);
    temp = (temp*temp)%m;
    if (b&1)
        return (temp*(a%m))%m; // if b is odd a^b = a^(b/2)*a^(b/2)*a
    return temp;
}

void sieve() { 
    spf[1] = 1; 
    for (ll i=2; i<MAXN; i++) 
        spf[i] = i; 
    for (ll i=4; i<MAXN; i+=2) 
        spf[i] = 2; 
  
    for (ll i=3; i*i<MAXN; i++) { 
        if (spf[i] == i) { 
            for (ll j=i*i; j<MAXN; j+=i) 
                if (spf[j]==j) 
                    spf[j] = i; 
        } 
    } 
} 

vl getFactorization(ll x) 
{ 
    vl ret; 
    while (x != 1) 
    { 
        ret.push_back(spf[x]); 
        x = x / spf[x]; 
    } 
    return ret; 
} 

ll ceil(ll a,ll b){
    return a/b+(a%b!=0);
}

void getZarr(string str, ll Z[]){
    ll n = str.length();
    ll L, R, k;
    L = R = 0;
    for (ll i = 1; i < n; ++i){
        if (i > R){
            L = R = i;
            while (R<n && str[R-L] == str[R])
                R++;
            Z[i] = R-L;
            R--;
        } else {
            k = i-L;
            if (Z[k] < R-i+1)
                Z[i] = Z[k];
            else {
                L = i;
                while (R<n && str[R-L] == str[R])
                    R++;
                Z[i] = R-L;
                R--;
            }
        }
    }
}


Measured memory_bytes: 256