/*
Telebe of adicto yani AzeTurk810
without limits
*/
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
#define ln '\n'
#define INFi 1e9
#define INFll 1e18
void solve() {
int n;
int a , b , t;
cin >> n;
vector<vector<int>> h(8);
for(int i = 0;i < n;i++) {
cin >> t >> a >> b;
a--;b--;
h[a].push_back(t);
}
for(int i = 0;i <8;i++) {
sort(h[i].begin() , h[i].end());
}
int ans1 = 0 , ans2 = 0;
for(int i = 0;i < 4;i++) {
int last = -1;
for(int &t : h[i]) {
if(last == -1) {
last = t;
} else {
if(t - last <= 10) {
ans1 += 50;
}
}
last = t;
ans1 += 100;
}
}
for(int i = 4;i < 8;i++) {
int last = -1;
for(int &t : h[i]) {
if(last == -1) {
last = t;
} else {
if(t - last <= 10) {
ans2 += 50;
}
}
last = t;
ans2 += 100;
}
}
cout << ans1 << ' ' << ans2 << ln;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
int t = 1;
// cin >> t;
for(int cases = 0 ; cases < t;cases ++) {
solve();
}
}
