#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(void){
	int n;
	int t;
	string s;
	int a=0,b=0;
	cin>>n;
	re(i,n){
		cin>>t>>s;
		int c=(double)t/1000.0*12.0;
		a+=min(c,(int)s.size());
		b+=s.size();

	}
	cout<<a<<" "<<b-a<<endl;
	return 0;
}