/* author : jj_master created : 27/11/2025 */ #include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define eb emplace_back #define fi first #define se second #define ins insert #define all(x) x.begin(), x.end() #define allr(x) x.rbegin(), x.rend() struct ap { int t; int a; int b; }; void solve() { int n; cin >> n; vector<ap> v(n); for(int i = 0; i < n; i++) { cin >> v[i].t >> v[i].a >> v[i].b; } int res1 = 0, res2 = 0; for(int i = 0; i < n; i++) { if(v[i].a < v[i].b) { res1 += 100; } else { res2 += 100; } } for(int i = 0; i < n - 1; i++) { if(v[i + 1].t - v[i].t <= 10) { if(v[i].a == v[i + 1].a) { if(v[i].a < v[i].b) { res1 += 50; } else { res2 += 50; } } else { continue; } } else { continue; } } cout << res1 << " " << res2 << '\n'; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); solve(); return 0; }