#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

pii score(){
    int id,in;
    cin >> id;
    vp v;
    //first:ピンの数、second:0無,1スペア,2ストライク
    rep(i,9){
        int sum = 0;
        cin >> in;
        if(in == 10){//ストライク
            v.push_back(pii(in,2));
        }else{
            sum += in;
            cin >> in;
            v.push_back(pii(sum,0));
            v.push_back(pii(in,sum+in == 10));
        }
    }
    int sum = 0;
    cin >> in;
    sum += in;
    v.push_back(pii(in,0));
    cin >> in;
    sum += in;
    v.push_back(pii(in,0));
    if(sum >= 10){
        cin >> in;
        sum += in;
        v.push_back(pii(in,0));
    }

    int ret = 0;
    rep(i,v.size()){
        ret += v[i].first;
        if(v[i].second >= 1 && i+1 < v.size()){
            ret += v[i+1].first;
        }
        if(v[i].second == 2 && i+2 < v.size()){
            ret += v[i+2].first;
        }
    }
    //cout << "!" << ret << " " << id << endl;
    return pii(-ret, id);
}


signed main(void) {
    int m;
    while(cin >> m, m){
        vp v;
        rep(i,m)v.push_back(score());
        sort(all(v));
        rep(i,m){
            cout << v[i].second << " " << -v[i].first << endl;
        }

    }
}

