#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node{
	double d;
	int x,y;
};
bool comp(node a, node b){
	return a.d < b.d;
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	vector<node>arr(n);
	for(int i = 0; i<n; i++){
		double d;
		cin >> d;
		int x,y;
		cin >> x >> y;
		arr[i] = {d,x,y};
	}
	sort(arr.begin(),arr.end(),comp);
	vector<int>p(n);
	vector<int>s(n);
	p[0] = arr[0].y;
	s[n-1]= arr[n-1].x;
	for(int i = 1; i<n; i++){
		p[i] = p[i-1] + arr[i].y;
	}
	for(int i = n-2; i>=0; i--){
		s[i] = s[i+1] + arr[i].x;
	}
	pair<double,double> ans = {0,0};
	for(int i = 0; i<n; i++){
		ans = max(ans,{min(s[i],p[i])*arr[i].d, arr[i].d});
	}
	if(ans.first <= 0){
		cout << "impossible\n";
	}
	else{
		cout << fixed << setprecision(2);
		cout << ans.second << ' ' << ans.first << '\n';
	}
	return 0;
}