import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

void main(){
    while(true) {
        auto n = readInt();
        if(n == 0) {
            break;
        }
        long[] id;
        long[] v;
        foreach(i; iota(n)) {
            auto l = readInts();
            id ~= l[0];
            v ~= (int[] p){
                int ans;
                foreach(j; iota(9)) {
                    if(p[0] == 10) {
                        ans += p[0] + p[1] + p[2];
                        p = p[1..$];
                    } else if(p[0] + p[1] == 10) {
                        ans += p[0] + p[1] + p[2];
                        p = p[2..$];
                    } else {
                        ans += p[0] + p[1];
                        p = p[2..$];
                    }
                }
                ans += p.sum(0);
                return ans;
            }(l[1..$]);
        }
        zip(v, id).sort!((a, b) => a[0] > b[0] || a[0] == b[0] && a[1] < b[1]);
        foreach(i; iota(n)) {
            writeln(id[i], " ", v[i]);
        }
    }
}