#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

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