/*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيمِ*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<int, int> pii;
#define pb push_back
#define pp pop_back
//#define endl "\n"
#define mpp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define sz(x) ((ll)(x).size())
#define vecpri(vec) for(auto i:vec) cout<<i<<' ';
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ali cout<<"Alice\n"
#define bob cout<<"Bob\n"
#define forr(i,a,b) for (int i = (a); i < (b); i++)
#define rep(i,n) forr(i, 0, n)
#define pri(n) rep(i,n) cout<<b[i]<<' ';
#define geta(n) rep(i,n) cin>>a[i];
#define gcd __gcd
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N = 1e6+9;
const ll inf = 1e18;
const ll mod = 1e9+7;
set<ll>st;
ll n,c,k,p,m,q,h,ans,cnt=0,mx;
void solve() {
cin>>n;vll a(n),b(n),t(n);
for(int i=0;i<n;i++){
cin>>t[i]>>a[i]>>b[i];
}
ll ans1=0,ans2=0;
vll last_time(19,-inf);
for(int i=0;i<n;i++){
if(a[i]>=1&&a[i]<=4){
ans1+=100;
if(t[i]-last_time[a[i]]<=10){
ans1+=50;
}
last_time[a[i]]=t[i];
}
else{
ans2+=100;
if(t[i]-last_time[a[i]]<=10){
ans2+=50;
}
last_time[a[i]]=t[i];
}
}
cout<<ans1<<' '<<ans2<<'\n';
}
int main() {
fast;
ll t=1;//cin>>t;
while (t--)solve();
return 0;
}
