#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

int main(void){
	const int n=12;
	long N; cin>>N;
	vector<long> T(N);
	vector<string> S(N);
	long ans1=0,ans2=0;
	REP(i,N){
		cin>>T[i]>>S[i];
		T[i]=n*T[i]/1000;
		ans1+=T[i];
		ans2+=max((long)(S[i].size()-T[i]),(long)0);
	}
	cout<<ans1<<" "<<ans2<<endl;
}