What Is Your Grade?

# include<stdio.h>
# include<string.h>
# include<algorithm>
using namespace std;
struct node{
	int key;
	int a,b,c,id;
}w[120];
bool cmp(node x,node y){
	if(x.key!=y.key) return x.key>y.key;
	if(x.a!=y.a) return x.a<y.a;
	if(x.b!=y.b) return x.b<y.b;
	if(x.c!=y.c) return x.c<y.c;
}
int save[110];
int main(){
	int n,i;
    while(scanf("%d",&n)!=EOF){
    	if(n<0){
    		break;
		}
		int cnt[10];
		memset(cnt,0,sizeof(cnt));
		for(i=0;i<n;i++){
			scanf("%d %d:%d:%d",&w[i].key,&w[i].a,&w[i].b,&w[i].c);
			cnt[w[i].key]++;
			w[i].id=i;
		}
		sort(w,w+n,cmp);
		int k=-1;
		int tcnt=0;
		for(i=0;i<n;i++){
			if(w[i].key!=k){
				k=w[i].key;
				tcnt=1;
			}
			else{
				tcnt++;
			}
			if(w[i].key==0){
				save[w[i].id]=50;
				continue;
			}
			if(w[i].key==5){
				save[w[i].id]=100;
				continue;
			}
			int tmp=100-10*(5-w[i].key);
			if(tcnt<=cnt[w[i].key]/2){
				tmp=tmp+5;}
				save[w[i].id]=tmp;
			
		}
		for(i=0;i<n;i++){
			printf("%d\n",save[i]);
			
		}
		printf("\n");
	}
	return 0;
	
}