24.12.2010

#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>
#include <algorithm>
#define mp make_pair;

using namespace std;

typedef pair<int, int> pr;

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    int n;
    fin >> n;
    vector<pr> vec(n + 1);
    vec[0] = make_pair(0, 1e9);
    vector<pair<int, int>> dp(n + 1);
    for (int i = 1; i <= n; i++) {
        int a;
        fin >> vec[i].first >> a;
        vec[i].second = round(1000 * (double(a) / vec[i].first));

    }
    dp[0] = make_pair(0, 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < i; j++) {
            if (vec[i].first > vec[j].first && vec[i].second < vec[j].second) {
                if (dp[j].first + 1 > dp[i].first) {
                    dp[i].second = dp[j].second;
                    dp[i].first = dp[j].first + 1;
                }
                else if (dp[j].first + 1 == dp[i].first) {
                    dp[i].second += dp[j].second;
                }
            }
        }
    }
    int maxL = (*max_element(dp.begin(), dp.end())).first;
    fout << maxL << endl;
    int sum = 0;
    for (pair<int, int> p: dp)
        if (p.first == maxL)
            sum += p.second;
    fout << sum << endl;

    fin.close();
    fout.close();
    return 0;
}