#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 15;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, m;
set<int> s;
map<int, int> ma, invma;
long long mx[maxn * 4], laz[maxn * 4];
int mxpos[maxn * 4];
void push_up(int u) {
  mx[u] = max(mx[(u << 1)], mx[(u << 1 | 1)]);
  if (mx[(u << 1)] >= mx[(u << 1 | 1)])
    mxpos[u] = mxpos[(u << 1)];
  else
    mxpos[u] = mxpos[(u << 1 | 1)];
}
void push_down(int u) {
  if (laz[u]) {
    mx[(u << 1)] += laz[u];
    mx[(u << 1 | 1)] += laz[u];
    laz[(u << 1)] += laz[u];
    laz[(u << 1 | 1)] += laz[u];
    laz[u] = 0;
  }
}
void build(int u, int l, int r) {
  if (l == r) {
    mx[u] = invma[l];
    mxpos[u] = invma[l];
    return;
  }
  int mid = (l + r) >> 1;
  build((u << 1), l, mid);
  build((u << 1 | 1), mid + 1, r);
  push_up(u);
}
void upd(int u, int l, int r, int ql, int qr, int v) {
  if (ql <= l && r <= qr) {
    mx[u] += v;
    laz[u] += v;
    return;
  }
  int mid = (l + r) >> 1;
  push_down(u);
  if (ql <= mid) upd((u << 1), l, mid, ql, qr, v);
  if (qr > mid) upd((u << 1 | 1), mid + 1, r, ql, qr, v);
  push_up(u);
}
pair<long long, int> query(int u, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) {
    return make_pair(mx[u], mxpos[u]);
  }
  int mid = (l + r) >> 1;
  push_down(u);
  if (ql <= mid && qr > mid)
    return max(query((u << 1), l, mid, ql, qr),
               query((u << 1 | 1), mid + 1, r, ql, qr));
  else if (ql <= mid)
    return query((u << 1), l, mid, ql, qr);
  else
    return query((u << 1 | 1), mid + 1, r, ql, qr);
}
struct node {
  int l, r, v;
} p[maxn];
bool cmp(node a, node b) { return a.r < b.r; }
mt19937 ran(0);
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d", &p[i].l, &p[i].r, &p[i].v);
    if (p[i].l > p[i].r) swap(p[i].l, p[i].r);
    s.insert(p[i].l);
    s.insert(p[i].r);
  }
  int cc = 0;
  for (auto v : s) {
    ma[v] = ++cc;
    invma[cc] = v;
  }
  sort(p + 1, p + n + 1, cmp);
  build(1, 1, cc);
  long long ans = 0;
  int ansl = 2e9, ansr = 2e9;
  invma[ansl] = ansl;
  int dd = 1;
  for (int i = 1; i <= n; i++) {
    int cntr = p[i].r;
    while (dd <= n && p[dd].r <= cntr) {
      upd(1, 1, cc, 1, ma[p[dd].l], p[dd].v);
      dd++;
    }
    pair<long long, int> sega = query(1, 1, cc, 1, ma[cntr]);
    if (sega.first - cntr > ans) {
      ans = sega.first - cntr;
      ansl = sega.second;
      ansr = cntr;
    }
  }
  printf("%lld\n", ans);
  printf("%d %d %d %d", ansl, ansl, ansr, ansr);
  return 0;
}
