#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
#include <sstream>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
using namespace std;

typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)

int main(int argc, char const *argv[]) {
  int n;
  cin >>n;

  int c=0,e=0;
  REP(i,n){
    int t;
    string s;
    cin >>t >>s;

    int m=t*12/1000;
    if(m>=s.size()) c+=s.size();
    else{
      c+=m;
      e+=(int)s.size()-m;
    }

  }
  printf("%d %d\n", c, e);
  return 0;
}