#include<iostream>
#include<string>
#include<cstring>
#include<complex>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<iomanip>
using namespace std;

#define REP(i, j) for (int i = 0; i < (int)j; ++i)
#define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i)
#define SORT(v) sort(v.begin(), v.end())
#define REVERSE(v) reverse(v.begin(), v.end())
typedef complex<double> P;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PII;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;

	int good = 0, bad = 0;
	REP(i,n) {
		double t;
		string s;
		cin >> t >> s;

		double p = floor(12 * t / 1000);
		if (p >= s.length()) good += s.length();
		else {
			good += p;
			bad += s.length() - p;
		}
	}

	cout << good << " " << bad << endl;

	return 0;
}