#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 105
int n;
int x1[MAXN],y1[MAXN],h1[MAXN];
int Abs(int x)
{
	if(x>=0) return x;
		return -x;
}
bool check(int h,int x,int y)
{
	for(int i=1;i<=n;i++)
		if(h1[i]!=max((h-abs(x1[i]-x)-abs(y1[i]-y)),0))
			return 0;
	return 1;
}
int main()
{
	scanf("%d",&n);
	int t1,t2,t3;
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d %d",&x1[i],&y1[i],&h1[i]);
		if(h1[i]>0) t1=x1[i],t2=y1[i],t3=h1[i];
	}
	for(int x=0;x<=100;x++)
		for(int y=0;y<=100;y++)
		{
			int h=t3+abs(t1-x)+abs(t2-y);
			if(check(h,x,y))
			{
				printf("%d %d %d\n",x,y,h);
				return 0;
			}
		}
	return 0;
}