#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 100;
const int INF = 1e+9;
int n, m;
int mas[N][N];
int st[N];
int k = 0;
int r = 0;
long long mult = 1;
long long sum = 0;
bool flag = 0;
int str_to_int (string & s){
	int ans = 0;
	int p = 1;
	for (int i = 0; i < s.length(); i++) {
		ans += p * (s[i] - '0');
		p *= 10;
	}
	return ans;
}
int cnt () {
	int res = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			if (!mas[j][i]) {
				res++;
				break;
			}
		}
	}
	return res;
}
int max_sum () {
	int ind = 0;
	int maxx = -INF;
	for (int i = 0; i < n; i++) {
		int sum = 0;
		for (int j = 0; j < m; j++) {
			sum += mas[i][j];
		}
		if (sum > maxx) {
			maxx = sum;
			ind = i;
		}
	}
	return ind;
}
int main () {
	freopen ("in.txt", "r", stdin);
	freopen ("out.txt", "w", stdout);
	string s;
	while (getline (cin, s)) {
		int len = s.length();
		string buf = "";
		for (int i = len - 1; i >= 0; i--) {
			if (s[i] != ' ') {
				buf += s[i];
			} else if (buf.length()){
				st[k++] = str_to_int (buf);
				buf = "";
			}
			if (i == 0) {
				st[k++] = str_to_int (buf);
				buf = "";
			}
		}
		m = k;
		for (int i = 0; i < k; i++) {
			mas[r][i] = st[k - i - 1];
		}
		r++, k = 0;
	}
	n = r;
	cout << "count of needed column " << cnt() << endl;
	cout << "number of the row with max sum " << max_sum() << endl;
	return 0;
}
/*
1 2 0 4
3 0 0 0
*/