#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

using namespace std;

int main(){	
	
   int n;
   cin >> n;
   long long ans1=0,ans2=0;
   for(int i=0;i<n;i++){
   	long long t;
   	string s;
   	cin >> t >> s;
   	long long now2=s.size()-12*t/1000;
   	if(now2<0)now2=0;
   	long long now1=s.size()-now2;
   	
   	//cout << now1 << " " << now2 << endl;
   	
   	ans2+=now2;
   	ans1+=now1;
   	
   }
   cout << ans1 << " " << ans2 << endl;
   	
	return 0;
}