/*
 Author: 曹北健
 Result: AC Submission_id: 4430025
 Created at: Wed May 11 2022 21:13:28 GMT+0800 (China Standard Time)
 Problem_id: 5771   Time: 611   Memory: 6804
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#include <time.h>
#pragma warning(disable:4996)
typedef struct item{
    char name[32];
    int group;
    int cai;
}item;
item a[114514] = { 0 };
int compare(const void *p, const void *q){
    item *a = (item *)p, *b = (item *)q;
    if(a->cai > b->cai){
        return -1;
    }
    else if(a->cai < b->cai){
        return 1;
    }
    else{
        if(a->group < b->group){
            return -1;
        }
        else if(a->group > b->group){
            return 1;
        }
        else{
            return strcmp(a->name, b->name);
        }
    }
}
int main(){
    int n = 0, i, j, t;
    scanf("%d", &n);
    for(i = 0; i < n; i++){
        scanf("%d%s", &a[i].group, a[i].name);
        for(j = 1; j <= 50; j++){
            scanf("%d", &t);
            if(t == j)a[i].cai += 1;
        }
    }
    qsort(a, n, sizeof(item), compare);
    for(i = 0; i < n; i++){
        printf("%s %d %d\n", a[i].name, a[i].group, a[i].cai);
    }
    return 0;
}