#include <bits/stdc++.h>
using namespace std;
const string yno[2] = {"NO\n", "YES\n"};
int n;
long long lz[1000005 * 4];
pair<long long, int> f[1000005 * 4];
vector<int> val;
vector<pair<int, int> > ev[1000005];
struct bg {
  int u, v, c;
};
void build(int k, int l, int r) {
  if (l == r) {
    f[k] = pair<int, int>(-val[l], l);
    return;
  }
  int m = (l + r) >> 1;
  build((k << 1) + 1, l, m);
  build((k << 1) + 2, m + 1, r);
  f[k] = max(f[(k << 1) + 1], f[(k << 1) + 2]);
}
void down(int k, int l, int r) {
  if (lz[k]) {
    int m = (l + r) >> 1;
    if (m - l >= 0) {
      f[(k << 1) + 1].first += lz[k];
      lz[(k << 1) + 1] += lz[k];
    }
    if (r - (m + 1) >= 0) {
      f[(k << 1) + 2].first += lz[k];
      lz[(k << 1) + 2] += lz[k];
    }
    lz[k] = 0;
  }
}
void up(int k, int u, int v, int l, int r, int c) {
  if (l > v || r < u) return;
  if (u <= l && r <= v) {
    lz[k] += c;
    f[k].first += c;
    return;
  }
  down(k, l, r);
  int m = (l + r) >> 1;
  up((k << 1) + 1, u, v, l, m, c);
  up((k << 1) + 2, u, v, m + 1, r, c);
  f[k] = max(f[(k << 1) + 1], f[(k << 1) + 2]);
}
pair<long long, int> get(int k, int u, int l, int r) {
  if (l > r || r < u) {
    return pair<long long, int>(-1e18, 0);
  }
  if (l >= u) {
    return f[k];
  }
  down(k, l, r);
  int m = (l + r) >> 1;
  pair<long long, int> r1 = get((k << 1) + 1, u, l, m);
  pair<long long, int> r2 = get((k << 1) + 2, u, m + 1, r);
  return max(r1, r2);
}
void process() {
  cin >> n;
  vector<bg> a(n);
  for (bg &i : a) {
    cin >> i.u >> i.v >> i.c;
    val.push_back(i.u);
    val.push_back(i.v);
  }
  sort(val.begin(), val.end());
  val.resize(unique(val.begin(), val.end()) - val.begin());
  n = val.size();
  for (bg &i : a) {
    i.u = lower_bound(val.begin(), val.end(), i.u) - val.begin();
    i.v = lower_bound(val.begin(), val.end(), i.v) - val.begin();
    if (i.u > i.v) swap(i.u, i.v);
    ev[i.u].push_back(pair<int, int>(i.v, i.c));
  }
  build(0, 0, n - 1);
  long long ans = 0;
  int rl = n, rr = n;
  for (int i = n - 1; i >= 0; i--) {
    for (pair<int, int> &j : ev[i]) up(0, j.first, n - 1, 0, n - 1, j.second);
    pair<long long, int> r = get(0, i, 0, n - 1);
    if (ans < r.first + val[i]) {
      ans = r.first + val[i];
      rl = val[i];
      rr = val[r.second];
    }
  }
  cout << ans << "\n" << rl << ' ' << rl << ' ' << rr << ' ' << rr;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  process();
  return 0;
}
