/* --- oinori hajimari-hajimari ---
 __  __               _   _     _                 _               _         _
|  \/  | __ _ _   _  | |_| |__ (_)___   ___ _   _| |__  _ __ ___ (_)___ ___(_) ___  _ __
| |\/| |/ _` | | | | | __| '_ \| / __| / __| | | | '_ \| '_ ` _ \| / __/ __| |/ _ \| '_ \
| |  | | (_| | |_| | | |_| | | | \__ \ \__ \ |_| | |_) | | | | | | \__ \__ \ | (_) | | | |
|_|  |_|\__,_|\__, |  \__|_| |_|_|___/ |___/\__,_|_.__/|_| |_| |_|_|___/___/_|\___/|_| |_|
            _ |___/                        _
  __ _  ___| |_    __ _  ___ ___ ___ _ __ | |_ ___  __| |
 / _` |/ _ \ __|  / _` |/ __/ __/ _ \ '_ \| __/ _ \/ _` |
| (_| |  __/ |_  | (_| | (_| (_|  __/ |_) | ||  __/ (_| |
 \__, |\___|\__|  \__,_|\___\___\___| .__/ \__\___|\__,_|
 |___/                              |_|
--- oinori oshimai --- */

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); }
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(i, (q).size()) { cerr << (q)[i] << (i == i_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; }
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
#define CHOKUDAI_ const
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using cll = DANCE_ DANCE_ CHOKUDAI_;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ll n; cin >> n;
    vector<tuple<ll, ll, ll>> x(n);
    REP(i, n) cin >> get<0>(x[i]) >> get<1>(x[i]) >> get<2>(x[i]);
    sort(ALL_OF(x), [](auto &a, auto &b) -> bool { return get<2>(a) > get<2>(b); });

    RANGE(cx, 0, 100) RANGE(cy, 0, 100) {

        ll asph = get<2>(x.front())
            + abs(cx - get<0>(x.front()))
            + abs(cy - get<1>(x.front()));
        bool okay = true;
        RANGE(i, 1, n-1) {
            ll exphi = max(0LL, asph - abs(cx - get<0>(x[i])) - abs(cy - get<1>(x[i])));
            if (exphi != get<2>(x[i])) {
                okay = false;
                break;
            }
        }
        
        if (okay) {
            cout << cx << " " << cy << " " << asph << endl;
            return 0;
        }

    }
    
}

Measured memory_bytes: 256