void solve(){
  int n;
  cin >> n;
  vector<vector<int>> a(n, vector<int>(3, 0));
  vector<pair<int, int>> vp;
  vp.push_back({-1, 0});
  for (int i = 0; i < n; i += 1) {
    cin >> a[i][0] >> a[i][1] >> a[i][2];
    vp.push_back({a[i][1], a[i][2]});
  }
  sort(vp.begin(), vp.end());
  auto check = [&] (int mid) {
    int dishes = 0;
    for (int i = 1; i <= n; i += 1) {
      dishes += (vp[i].first - vp[i - 1].first) * mid;
      if (vp[i].second > dishes) return false;
      else dishes -= vp[i].second;
    }
    return true;
  };
  int l = 0, r = 1e9;
  while (r - l > 1) {
    int mid = (l + r) / 2;
    if (!check(mid)) l = mid;
    else r = mid;
  }
  cout << r << endl;
}