#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> T(n);
    vector<string> S(n);

    int hit = 0;
    int miss = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> T[i] >> S[i];
        int s_length = (int)S[i].size();
        int mini_hit = min(s_length, T[i] * 12 / 1000);
        miss += s_length - mini_hit;
        hit += mini_hit;
    }
    cout << hit << " " << miss << endl;
}