#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 7;
const long long inf = 1e18;
int n;
long long lz[N << 2];
pair<long long, int> t[N << 2];
int b[N], tot;
int ax, ay;
long long ans;
struct Node {
  int x, y, c;
  bool operator<(const Node k) const { return y < k.y; }
} a[N];
void bd(int rt, int l, int r) {
  lz[rt] = 0;
  if (l == r) {
    t[rt].first = b[l];
    t[rt].second = l;
    return;
  }
  int m = l + r >> 1;
  bd(rt << 1, l, m);
  bd(rt << 1 | 1, m + 1, r);
  if (t[rt << 1].first > t[rt << 1 | 1].first)
    t[rt] = t[rt << 1];
  else
    t[rt] = t[rt << 1 | 1];
}
void pd(int rt) {
  if (lz[rt]) {
    t[rt << 1].first += lz[rt];
    t[rt << 1 | 1].first += lz[rt];
    lz[rt << 1] += lz[rt];
    lz[rt << 1 | 1] += lz[rt];
    lz[rt] = 0;
  }
}
void upd(int rt, int l, int r, int L, int R, long long val) {
  if (L <= l && r <= R) {
    t[rt].first += val;
    lz[rt] += val;
    return;
  }
  pd(rt);
  int m = l + r >> 1;
  if (L <= m) upd(rt << 1, l, m, L, R, val);
  if (m < R) upd(rt << 1 | 1, m + 1, r, L, R, val);
  if (t[rt << 1].first > t[rt << 1 | 1].first)
    t[rt] = t[rt << 1];
  else
    t[rt] = t[rt << 1 | 1];
}
pair<long long, int> que(int rt, int l, int r, int L, int R) {
  if (L <= l && r <= R) return t[rt];
  pd(rt);
  int m = l + r >> 1;
  pair<long long, int> le = pair<long long, int>(-inf, 0),
                       ri = pair<long long, int>(-inf, 0);
  if (L <= m) le = que(rt << 1, l, m, L, R);
  if (m < R) ri = que(rt << 1 | 1, m + 1, r, L, R);
  return (le.first > ri.first) ? le : ri;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].c);
    if (a[i].x > a[i].y) swap(a[i].x, a[i].y);
    b[++tot] = a[i].x;
    b[++tot] = a[i].y;
  }
  sort(b + 1, b + 1 + tot);
  tot = unique(b + 1, b + 1 + tot) - b - 1;
  for (int i = 1; i <= n; i++) {
    a[i].x = lower_bound(b + 1, b + 1 + tot, a[i].x) - b;
    a[i].y = lower_bound(b + 1, b + 1 + tot, a[i].y) - b;
  }
  bd(1, 1, tot);
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    upd(1, 1, tot, 1, a[i].x, a[i].c);
    if (i < n && a[i + 1].y == a[i].y) continue;
    pair<long long, int> tmp = que(1, 1, tot, 1, a[i].y);
    if (tmp.first - b[a[i].y] > ans) {
      ans = tmp.first - b[a[i].y];
      ax = tmp.second;
      ay = a[i].y;
    }
  }
  printf("%lld\n", ans);
  b[tot + 1] = -9999;
  if (ans == 0) {
    for (int i = 1; i <= tot; i++) {
      if (b[i] == b[i + 1]) continue;
      if (b[i] + 1 != b[i + 1]) {
        printf("%d %d %d %d\n", b[i] + 1, b[i] + 1, b[i] + 1, b[i] + 1);
        break;
      }
    }
  } else
    printf("%d %d %d %d\n", b[ax], b[ax], b[ay], b[ay]);
}
