#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int _ = 200010;

int x[_][3];
ll mx[8];
ll val[_];

int main() {
	ios::sync_with_stdio(false); cin.tie(NULL);

	int N; cin >> N;
	for (int i = 1; i <= N; ++i)
		for (int j = 0; j != 3; ++j)
			cin >> x[i][j];
	for (int i = 1; i <= N; ++i) {
		for (int s = 0; s != 8; ++s) {
			ll sum = 0;
			for (int j = 0; j != 3; ++j)
				if ((s >> j) & 1) sum += x[i][j];
			mx[s] = max(mx[s], sum);
		}
	}
	for (int i = 1; i <= N; ++i) {
		for (int s = 0; s != 8; ++s) {
			ll sum = 0;
			for (int j = 0; j != 3; ++j)
				if ((s >> j) & 1) sum += x[i][j];
			val[i] = max(val[i], mx[s] - sum);
		}
	}
	int ans = min_element(val + 1, val + N + 1) - val;
	cout << val[ans] << ' ' << ans << '\n';

	return 0;
}