#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <climits>
#include <numeric>
#include <iterator>
#include <cmath>
#include <set>
#include <bitset>
#include <cassert>
#include <cstdlib>
using namespace std;

inline int can(const int m) noexcept {
	return floor(12 * m / 1000);
}

void solve() {
	int N;
	cin >> N;

	int cnt  {0};
	int wcnt {0};
	for (int i = 0; i < N; ++i) {
		string s;
		int t;
		cin >> t >> s;

		const auto length {s.size()};
		if (can(t) >= length) {
			cnt += length;
		} else {
			cnt += can(t);
			wcnt += length - can(t);
		}
	}

	cout << cnt << ' ' << wcnt << endl;
}

int main() {
	solve();
	return 0;
}