#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
int n;
ll p[N][3],mv[111];
int main() {
	scanf("%d",&n);
	rep(i,0,n) {
		scanf("%lld%lld%lld",&p[i][0],&p[i][1],&p[i][2]);
		rep(s,0,8) {
			ll ss=0;
			rep(j,0,3) if (s&(1<<j)) ss+=p[i][j];
			mv[s]=max(mv[s],ss);
		}
	}
	ll ret=1ll<<60;
	int mid=-1;
	rep(i,0,n) {
		ll mdif=0;
		rep(s,0,8) {
			ll ss=0;
			rep(j,0,3) if (s&(1<<j)) ss+=p[i][j];
			mdif=max(mdif,mv[s]-ss);
		}
		if (mdif<ret) {
			ret=mdif;
			mid=i;
		}
	}
	printf("%lld %d\n",ret,mid+1);
}