21-22_N2

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

vector <pii> a;

void read(int d, int number) {
    int x = 0;
    x += 16 * d;
    cin >> d;
    x += d;
    int S = 0;
    for (int i = 0; i < x; ++i) {
        cin >> d; S += d;
    }
    a.push_back({S, number});
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int cnt = 0;
    while (1) {
        cnt++;
        string s; cin >> s;
        if (s == ".") {
            break;
        }
        int k = stoi(s);
        read(k, cnt);
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    cout << a[0].second << ' ' << a[0].first << "\n";
}