#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N 110

using namespace std;

struct st
{
    int id, x, h, y;
} node[N];

int cmp(const void *a, const void *b)
{
    st *s1 = (st *)a, *s2 = (st *)b;
    if(s1->x == s2->x)
        return s1->h - s2->h;
    else
        return s2->x - s1->x;
}

int cmp1(const void *a, const void *b)
{
    return *(int *)a - *(int *)b;
}

int main()
{
    int i, a1, a2, a3, a4, n, h, m, s;
    while(scanf("%d", &n), n != -1)
    {
        memset(node, 0, sizeof(node));
        a1 = a2 = a3 = a4 = 0;
        for(i = 0 ; i < n ; i++)
        {
            scanf("%d", &node[i].x);
            scanf("%d:%d:%d", &h, &m, &s);
            node[i].h  = h * 3600 + m * 60 + s;
            node[i].id = i;
            if(node[i].x == 1)
                a1++;
            else if(node[i].x == 2)
                a2++;
            else if(node[i].x == 3)
                a3++;
            else if(node[i].x == 4)
                a4++;
        }
        qsort(node, n, sizeof(node[0]), cmp);
        a1 /= 2, a2 /= 2, a3 /= 2, a4 /= 2;
        for(i = 0 ; i < n ; i++)
        {
            if(node[i].x == 5)
                node[i].y = 100;
            else if(node[i].x == 4)
            {
                if(a4 != 0)
                {
                    node[i].y = 95;
                    a4--;
                }
                else
                    node[i].y = 90;
            }
            else if(node[i].x == 3)
            {
                if(a3 != 0)
                {
                    node[i].y = 85;
                    a3--;
                }
                else
                    node[i].y = 80;
            }
            else if(node[i].x == 2)
            {
                if(a2 != 0)
                {
                    node[i].y = 75;
                    a2--;
                }
                else
                    node[i].y = 70;
            }
            else if(node[i].x == 1)
            {
                if(a1 != 0)
                {
                    node[i].y = 65;
                    a1--;
                }
                else
                    node[i].y = 60;
            }
            else
                node[i].y = 50;
        }
        qsort(node, n, sizeof(node[0]), cmp1);
        for(i = 0 ; i < n ; i++)
            printf("%d\n", node[i].y);
        printf("\n");

    }
    return 0;
}