// Hey there.. I love you <3
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

mt19937 rnd(time(nullptr));

const int N = 1e5 + 5, mod = 1e9 + 7;
const double pi = acos(-1), eps = 1e-10;

int n;
tuple<double, int, int> prices[N];

void work() {
    
    cin >> n;
    
    ll bSum = 0;
    for (int i = 0; i < n; ++i) {
        double p;
        int b, s;
        cin >> p >> b >> s;
        bSum += b;
        prices[i] = {p, b, s};
    }
    sort(prices, prices + n);
    
    ll sSum = 0;
    double maxSum = 0, bestP = -1;
    for (int i = 0; i < n; ++i) {
        sSum += get<2>(prices[i]);
        double curSum = min(bSum, sSum) * get<0>(prices[i]);
        if (curSum > maxSum) maxSum = curSum, bestP = get<0>(prices[i]);
        bSum -= get<1>(prices[i]);
    }
    
    if (bestP == -1)
        cout << "impossible" << endl;
    else
        cout << fixed << setprecision(12) << bestP << " " << maxSum << endl;
    
}


void init() {
    cin.tie(nullptr);
    istream::sync_with_stdio(false);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);


}

int main() {
    init();
    
    int testCases = 1;
//    cin >> testCases;
    while (testCases--) work();
    
    return 0;
}