#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <fstream>
#include <sstream>
using namespace std;
typedef long long ll;

int main(){
    int N;
    cin >> N;
    
    int ok = 0, ng = 0;
    for(int i=0;i<N;i++){
        int T;
        string S;
        
        cin >> T >> S;
        
        int tmp = min((int)S.size(), 12 * T / 1000);
        ok += tmp;
        ng += S.size() - tmp;
    }
    
    cout << ok << " " << ng << endl;
    
    return 0;
}