#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
#define rep(i,x) for(int i=0;i<(int)(x);i++)

int main(){
	int n, t, can, r = 0, w = 0;
	string s;
	cin >> n;
	rep(i,n) {
		cin >> t >> s;
		can = (int)floor(12*t/1000);
		if (s.size() <= can) r += s.size();
		else {
			r += can;
			w += s.size() - can;
		}
	}
	cout << r << " " << w << endl;
	return 0;
}