#include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30

using namespace std;
typedef long long ll;
typedef pair<int, int> pp;

int main(void) {
	int num, i, k, ok = 0, ng = 0;
	string s;
	cin >> num;
	rep(i, num) {
		cin >> k >> s;
		k = 12 * k / 1000;
		ok += min((int)s.size(), k);
		ng += max(0, (int)s.size() - k);
	}
	cout << ok << " ";
	cout << ng << "\n";
	return 0;
}