#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        int n;
        cin >> n;

        auto readDouble = [&]() {
            int x, y;
            char dot;
            cin >> x >> dot >> y;
            return x * 100 + y;
        };

        auto writeDouble = [&](i64 x) {
            cout << x / 100 << '.';
            cout << setw(2) << setfill('0') << x % 100;
        };

        vector<array<int, 3>> a(n);

        for (auto &[p, b, s] : a) {
            p = readDouble();
            cin >> b >> s;
        }

        sort(a.begin(), a.end());

        vector<int> pref(n + 1), suf(n + 1);

        for (int i = 0; i < n; i++) {
            pref[i + 1] = pref[i] + a[i][2];
        }
        for (int i = n - 1; i >= 0; i--) {
            suf[i] = suf[i + 1] + a[i][1];
        }

        int price = -1;
        i64 best = 0;

        for (int i = 1; i < n; i++) {
            int p = a[i][0];
            i64 res = 1LL * p * min(pref[i], suf[i]);
            if (res > best) {
                best = res;
                price = p;
            }
        }

        if (best == 0) {
            cout << "impossible\n";
            return;
        }

        writeDouble(price);
        cout << ' ';
        writeDouble(best);
        cout << '\n';
    };

    solve();

    return 0;
}