#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); }
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(dumpall_i, (q).size()) { cerr << q[dumpall_i] << (dumpall_i == (q).size() - 1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; }
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
using  ll = long long;
using ull = unsigned long long;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ll m;
    while (cin >> m, m) {

        vector<ll> id(m);
        vector<ll> score(m, 0);

        REP(i, m) {
            cin >> id[i];
            ll sl = 0, r = 0;
            ll b = 0;
            vector<ll> pins(12, 0);
            vector<ll> fpin(12, 0);
            vector<bool> strike(12, false);
            vector<ll> term(12, 0);
            while (sl < 10) {
                ll x; cin >> x;
                r += x;
                if (b == 0) fpin[sl] = x;
                b++;
                if (r == 10 || b == 2) {
                    pins[sl] = r;
                    strike[sl] = r == 10 && b == 1;
                    b = 0;
                    r = 0;
                    sl++;
                }
            }
            if (pins[9] == 10) {
                ll x; cin >> x;
                fpin[10] = pins[10] = x;
                if (x == 10) {
                    strike[10] = true;
                } else if (strike[9]) {
                    cin >> x;
                    pins[10] += x;
                }
                if (strike[9] && strike[10]) {
                    cin >> x;
                    fpin[11] = pins[11] = x;
                    strike[11] = x == 10;
                }
            }
            REP(j, 9) {
                term[j] = pins[j];
                if (pins[j] == 10) {
                    if (strike[j]) {
                        if (j+1 < 12) {
                            term[j] += pins[j+1];
                            if (strike[j+1] && j+2 < 12) {
                                term[j] += fpin[j+2];
                            }
                        }
                    } else {
                        if (j+1 < 12) term[j] += fpin[j+1];
                    }
                }
            }
            term[9] = pins[9] + pins[10] + pins[11];
            score[i] = accumulate(ALL_OF(term), 0LL);
        }

        vector<ll> rank(m, 0);
        iota(ALL_OF(rank), 0LL);
        sort(ALL_OF(rank), [&](ll i, ll j) -> bool {
            if (score[i] != score[j]) {
                return score[i] > score[j];
            } else {
                return id[i] < id[j];
            }
        });

        REP(_i, m) {
            ll i = rank[_i];
            cout << id[i] << " " << score[i] << "\n";
        }

    }
    
}


Measured memory_bytes: 3168