Problem: Petya recently found a game "Choose a Square". In this game, there are n points numbered from 1 to n on an infinite field. The i-th point has coordinates (x_i, y_i) and cost c_i.

You have to choose a square such that its sides are parallel to coordinate axes, the lower left and upper right corners belong to the line y = x, and all corners have integer coordinates.

The score you get is the sum of costs of the points covered by the selected square minus the length of the side of the square. Note that the length of the side can be zero.

Petya asks you to calculate the maximum possible score in the game that can be achieved by placing exactly one square.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 5 ⋅ 10^5) — the number of points on the field.

Each of the following n lines contains three integers x_i, y_i, c_i (0 ≤ x_i, y_i ≤ 10^9, -10^6 ≤ c_i ≤ 10^6) — coordinates of the i-th point and its cost, respectively.

Output

In the first line print the maximum score Petya can achieve.

In the second line print four integers x_1, y_1, x_2, y_2 (0 ≤ x_1, y_1, x_2, y_2 ≤ 2 ⋅ 10^9, x_1 = y_1, x_2 = y_2, x_1 ≤ x_2) separated by spaces — the coordinates of the lower left and upper right corners of the square which Petya has to select in order to achieve the maximum score.

Examples

Input


6
0 0 2
1 0 -5
1 1 3
2 3 4
1 4 -4
3 1 -1


Output


4
1 1 3 3


Input


5
3 3 0
3 3 -3
0 2 -1
3 1 3
0 0 -2


Output


0
1 1 1 1

Note

The field corresponding to the first example: <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500000 + 10, MAXT = MAXN * 8;
const long long LINF = 1LL << 60;
struct Seg {
  int x, y, c;
  bool operator<(const Seg &s1) const { return x < s1.x; }
} seg[MAXN];
int hashx[MAXT], cnt;
struct Segtree {
  int l, r;
  long long add, mx;
  int pos;
} t[MAXT];
int val[MAXT];
void updatemx(long long &mx, int &pos, long long mx1, int pos1) {
  if (mx1 > mx) {
    mx = mx1;
    pos = pos1;
  }
}
void pushup(int p) {
  t[p].mx = t[p << 1].mx;
  t[p].pos = t[p << 1].pos;
  updatemx(t[p].mx, t[p].pos, t[p << 1 | 1].mx, t[p << 1 | 1].pos);
}
void add_t(int p, long long d) {
  t[p].add += d;
  t[p].mx += d;
}
void pushdown(int p) {
  if (t[p].add != 0) {
    add_t(p << 1, t[p].add);
    add_t(p << 1 | 1, t[p].add);
    t[p].add = 0;
  }
}
void buildtree(int p, int l, int r) {
  t[p] = (Segtree){l, r, 0, 0, 0};
  if (l == r) {
    t[p].mx = (long long)val[l];
    t[p].pos = l;
    return;
  }
  int mid = (l + r) >> 1;
  buildtree(p << 1, l, mid);
  buildtree(p << 1 | 1, mid + 1, r);
  pushup(p);
}
void change(int p, int l, int r, int ql, int qr, long long d) {
  if (ql == l && qr == r) {
    add_t(p, d);
    return;
  }
  pushdown(p);
  int mid = (l + r) >> 1;
  if (ql <= mid) change(p << 1, l, mid, ql, min(qr, mid), d);
  if (qr > mid) change(p << 1 | 1, mid + 1, r, max(ql, mid + 1), qr, d);
  pushup(p);
}
long long que_mx(int p, int l, int r, int ql, int qr, int &pos) {
  if (ql == l && qr == r) {
    pos = t[p].pos;
    return t[p].mx;
  }
  pushdown(p);
  int mid = (l + r) >> 1;
  long long res = -LINF, temp_res;
  int temp_pos;
  if (ql <= mid) {
    temp_res = que_mx(p << 1, l, mid, ql, min(qr, mid), temp_pos);
    updatemx(res, pos, temp_res, temp_pos);
  }
  if (qr > mid) {
    temp_res = que_mx(p << 1 | 1, mid + 1, r, max(ql, mid + 1), qr, temp_pos);
    updatemx(res, pos, temp_res, temp_pos);
  }
  pushup(p);
  return res;
}
int findx(int key) {
  int l = 1, r = cnt;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (hashx[mid] == key)
      return mid;
    else if (hashx[mid] < key)
      l = mid + 1;
    else
      r = mid - 1;
  }
  return l;
}
int main() {
  int n;
  scanf("%d", &n);
  cnt = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d%d", &seg[i].x, &seg[i].y, &seg[i].c);
    if (seg[i].x > seg[i].y) swap(seg[i].x, seg[i].y);
    hashx[++cnt] = seg[i].x;
    hashx[++cnt] = seg[i].y;
  }
  sort(hashx + 1, hashx + 1 + cnt);
  cnt = 1;
  for (int i = 2; i <= n * 2; ++i) {
    if (hashx[i] != hashx[i - 1]) {
      hashx[++cnt] = hashx[i];
    }
  }
  for (int i = 0; i < n; ++i) {
    seg[i].x = findx(seg[i].x);
    seg[i].y = findx(seg[i].y);
  }
  sort(seg, seg + n);
  memset(val, 0, sizeof(0));
  for (int i = 1; i <= cnt; ++i) val[i] = hashx[1] - hashx[i];
  buildtree(1, 1, cnt);
  for (int i = 0; i < n; ++i)
    change(1, 1, cnt, seg[i].y, cnt, (long long)seg[i].c);
  long long ans = -LINF;
  int ansl = -1, ansr = -1;
  int pos = 0;
  for (int l = 1; l <= cnt; ++l) {
    int temp_pos;
    long long que =
        que_mx(1, 1, cnt, l, cnt, temp_pos) + (long long)(hashx[l] - hashx[1]);
    if (que > ans) {
      ans = que;
      ansl = hashx[l];
      ansr = hashx[temp_pos];
    }
    while (pos < n && seg[pos].x == l) {
      change(1, 1, cnt, seg[pos].y, cnt, (long long)-seg[pos].c);
      ++pos;
    }
  }
  if (ans < 0) {
    ans = 0;
    ansl = ansr = hashx[cnt] + 1;
  }
  cout << ans << endl;
  cout << ansl << " " << ansl << " " << ansr << " " << ansr << endl;
  return 0;
}