// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    long N = lread();
    auto X = new long[](N);
    auto Y = new long[](N);
    auto H = new long[](N);
    foreach (i; 0 .. N)
        scan(X[i], Y[i], H[i]);
    zip(H, X, Y).sort();

    foreach (cx; 0 .. 100 + 1)
        cy: foreach (cy; 0 .. 100 + 1)
        {
            long base = H[$ - 1] + abs(X[$ - 1] - cx) + abs(Y[$ - 1] - cy);
            foreach (i; 0 .. N - 1)
            {
                long h = H[i] + abs(X[i] - cx) + abs(Y[i] - cy);
                if (H[i] == 0)
                {
                    if (h < base)
                        continue cy;
                }
                else
                {
                    if (base != h)
                        continue cy;
                }
            }
            arywrite([cx, cy, base]);
            return;
        }
}
