#ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("popcnt,abm,mmx,avx2")
#endif
#include <bits/stdc++.h>

using namespace std;

#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define rep(i, l, r) for (int i = l; i < r; ++i)
using Long = long long;
using Double = double;
using vi = vector<int>;

template <class U, class V>
istream& operator>>(istream& is, pair<U, V>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& x : v) {
    is >> x;
  }
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto& x : v) {
    os << x << " ";
  }
  return os;
}

struct Bid {
  double price;
  double buy;
  double sell;
  bool operator<(const Bid& other) const { return price < other.price; }
};

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef Local
  freopen("test.in", "r", stdin);
  freopen("test.out", "w", stdout);
#else
#define endl '\n'
#endif
  int n;
  cin >> n;
  vector<Bid> bids(n);
  for (int i = 0; i < n; ++i) {
    cin >> bids[i].price >> bids[i].buy >> bids[i].sell;
  }
  sort(all(bids));
  for (int i = 1; i < n; ++i) {
    bids[i].sell += bids[i - 1].sell;
  }
  for (int i = n - 2; i >= 0; --i) {
    bids[i].buy += bids[i + 1].buy;
  }

  int best_price = -1;
  double res = 0;
  for (int i = 0; i < n; ++i) {
    double sales = min(bids[i].buy, bids[i].sell);
    if (sales * bids[i].price > res) {
      res = sales * bids[i].price;
      best_price = i;
    }
  }
  if (best_price == -1) {
    cout << "impossible" << endl;
    return 0;
  }

  cout << bids[best_price].price << " " << res << endl;
  return 0;
}