#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

int main(){
    int n,t,alll=0,miss=0;
    string s;
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        cin >> t >> s;
        
        alll+=(int)s.size();
        miss+=max(0,(int)s.size()-(12*t/1000));
        
    }
    
    printf("%d %d\n",alll-miss,miss);
    
    return 0;
}