#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

unsigned int randxor() {
    static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned int t;
    t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

struct Sieve {
    vector<int> primes;
    vector<int> _isPrime;
    vector<int> prime_factor_num; // soinsuu no kosuu
    Sieve(int n) : _isPrime(n + 1, 1), prime_factor_num(n + 1, 0) {
        buildPrimes();
    }
    void buildPrimes() {
        _isPrime[0] = _isPrime[1] = 0;
        int n = _isPrime.size();
        REP(i, 2, n) {
            if (_isPrime[i]) {
                primes.push_back(i);
                prime_factor_num[i] = 1;
                for (int j = i + i; j < n; j += i) _isPrime[j] = 0, prime_factor_num[j]++;
            }
        }
    }
    bool isPrime(int i) {
        return _isPrime[i];
    }
};

void solve() {
    int n;
    cin >> n;
    int ok = 0, ng = 0;
    rep(i, n) {
        int t;
        string s;
        cin >> t >> s;
        int x = min((int)s.size(), 12 * t / 1000);
        ok += x;
        ng += s.size() - x;
    }
    cout << ok << " " << ng << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}