#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 1e5 + 5, M = 350;
const ld PI = acos(-1.0), EPS = 1e-9;

int n;
pair<double, pair<int, int> > p[N];
int l[N], r[N];
double ans = 0;

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> p[i].first >> p[i].second.first >> p[i].second.second;
    }
    sort(p + 1, p + n + 1);
    for (int i = 1; i <= n; i++) l[i] = p[i].second.first, r[i] = p[i].second.second;
    for (int i = n; i >= 1; i--) l[i] += l[i + 1];
    for (int i = 1; i <= n; i++) r[i] += r[i - 1];
    int idx = 0;
    for (int i = 1; i <= n; i++) {
        if (l[i] > 0 && r[i] > 0) {
            double tmp = p[i].first * min(l[i], r[i]);
            if (tmp > ans) ans = tmp, idx = i;
        }
    }
    if (idx) cout << p[idx].first << " " << ans;
    else cout << "impossible";
    return 0;
}