#include "bits/stdc++.h"
using namespace std;
#define io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define ff first
#define ss second
#define pb push_back
#define skip continue
#define intt int
#define all(v) v.begin(),v.end()
using pii=pair<int,int>;
const int MOD=1e9+7;
const int MAX=5e5+1;
#define int long long
map<int,vector<int>>g;
vector<int>dis;
int a[MAX],segt[4*MAX];
void solve(){
int n;
cin>>n;
map<int,vector<int>>m;
for(int i=0;i<n;i++){
int a,b,c;
cin>>b>>c>>a;
m[c].pb(b);
}
int t1=0,t2=0,prev=-100;
for(int i=1;i<9;i++){
prev=-100;
if(m.find(i)==m.end()) skip;
for(int v:m[i]){
if(i<5){
t1+=100;
if(prev+10>=v) t1+=50;
prev=v;
}else{
t2+=100;
if(prev+10>=v) t2+=50;
prev=v;
}
}
}
cout<<t1<<" "<<t2;
}
signed main(){
int t=1;
//cin>>t;
while(t--){
solve();
}
}
