#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	int n;
	while(cin>>n,n){
		vector<pii> v;
		rep(i,n){
			vector<pii> tt;
			int id;
			cin>>id;
			int t;
			int cnt=1;
			while(1){
				cin>>t;
				if(cnt==10){
					int a=t;
					if(a==10){
						tt.PB(mkp(a,cnt));
						cin>>t;
						tt.PB(mkp(t,cnt));
						cin>>t;
						tt.PB(mkp(t,cnt));
						break;
					}
					else{
						tt.PB(mkp(t,cnt));
						cin>>t;
						tt.PB(mkp(t,cnt));
						if(a+t==10){
							cin>>t;
							tt.PB(mkp(t,cnt));	
						}
						break;
						
					}
				}
				else if(t==10){
					tt.PB(mkp(t,cnt));
				}
				else{
					tt.PB(mkp(t,cnt));
					cin>>t;
					tt.PB(mkp(t,cnt));
				}
				cnt++;
			}
			int tmp=0;
			// cout<<"id = "<<id<<endl;
			// rep(i,tt.size()){
				// cout<<tt[i].F<<" "<<tt[i].S<<endl;
			// }
			// cout<<endl;
			rep(i,tt.size()){
				if(tt[i].S==10){
					tmp+=tt[i].F;
					continue;
				}
				if(tt[i].F==10){
					tmp+=10+tt[i+1].F+tt[i+2].F;
					continue;
				}
				if(tt[i].F+tt[i+1].F==10){
					tmp+=10+tt[i+2].F;
					i++;
				}
				else{
					tmp+=tt[i].F+tt[i+1].F;
					i++;
				}
			}
			v.PB(mkp(-tmp,id));
		}
		sort(ALL(v));
		rep(i,n) cout<<v[i].S<<" "<<-v[i].F<<endl;
	}
}



}
main() try{
    mainmain();
}
catch(...){
}