#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
using ll = long long;
using lf = long double;
using lll = __int128;
using ull = unsigned long long;
const int N = 1e5 + 10;
const int INF = 1e9;
struct elem {
  int x, y, ty, c;
  bool operator<(const elem &t) const { return x == t.x ? (c == t.c ? y < t.y : c < t.c) : x < t.x; }
} a[N], ta[N];
struct st {
  int v, *pos;
  bool operator<(const st &t) const { return v < t.v; }
} ar[N];
struct BIT {
  int n, mn[N], vis[N], TIM;
  void clear() { ++TIM; }
  void init(int x) { n = x; }
  void Ins(int x, int v) {
    while (x <= n) mn[x] = (vis[x] == TIM ? min(mn[x], v) : (vis[x] = TIM, v)), x += (x & -x);
  }
  int Que(int x) {
    static int ret;
    ret = INF;
    while (x) ret = (vis[x] == TIM ? min(ret, mn[x]) : ret), x -= (x & -x);
    return ret;
  }
} B1, B2;
int ans, m;
void Getans(int n) {
  // log("!!GETANS:\n");
  // for (int i = 1; i <= n; ++i) log("(%d,%d) %d\n", ta[i].x, ta[i].y, ta[i].c);
  B1.clear(), B2.clear();
  static int premin, mnx;
  premin = INF;
  for (int i = n; i >= 1; --i) {
    // log("i=%d\n", i);
    if (!ta[i].c) {
      ans = min(ans, ta[i].y - ta[i].x + premin);
      // log("CMIN %d\n", ta[i].y - ta[i].x + premin);
    } else if (ta[i].c == 1) {
      mnx = min(B1.Que(m - ta[i].ty + 1) - ta[i].y, B2.Que(ta[i].ty));
      premin = min(premin, mnx);
      // log("premin %d\n", premin);
    } else {
      B1.Ins(m - ta[i].ty + 1, ta[i].x);
      B2.Ins(ta[i].ty, ta[i].x - ta[i].y);
    }
  }
  // log("Done,ans=%d\n", ans);
}
int n;
int xi[N], yi[N], py[N], ci[N];
int sz;
void Solve(int l, int r, int al, int ar) {
  if (l > r || al > ar) return;
  // log(">>>>>SOLVE %d %d,ar:\n", l, r);
  // for (int i = al; i <= ar; ++i) log("(%d,%d[%d]) %d\n", a[i].x, a[i].y, a[i].ty, a[i].c);
  int mid = (l + r >> 1);
  // log("MID=%d\n", mid);
  sz = 0;
  for (int i = al; i <= ar; ++i) {
    if (!a[i].c && a[i].ty >= mid) ta[++sz] = a[i];
    if (a[i].c && a[i].ty <= mid) ta[++sz] = a[i];
  }
  Getans(sz);
  int p1 = al - 1, p2 = ar + 1;
  for (int i = al; i <= ar; ++i) {
    if (a[i].ty > mid) ta[--p2] = a[i];
    if (a[i].ty < mid) ta[++p1] = a[i];
  }
  for (int i = al; i <= p1; ++i) a[i] = ta[i];
  for (int i = p2; i <= ar; ++i) a[p2 + ar - i] = ta[i];
  Solve(l, mid - 1, al, p1), Solve(mid + 1, r, p2, ar);
}
int tc[N];
void Calc(int x, int y, int z) {
  // log("---------------------\nCALC %d%d%d\nsets:\n", x, y, z);
  for (int i = 1; i <= n; ++i) ci[i] = (tc[i] == x ? 0 : (tc[i] == y ? 1 : 2));
  // for (int i = 1; i <= n; ++i) log("(%d,%d) %d\n", xi[i], yi[i], ci[i]);
  for (int i = 1; i <= n; ++i) ar[i] = (st){yi[i], &py[i]};
  sort(ar + 1, ar + n + 1);
  m = 0;
  ar[0].v = -INF;
  for (int i = 1; i <= n; ++i) m += (ar[i].v != ar[i - 1].v), *ar[i].pos = m;
  for (int i = 1; i <= n; ++i) a[i] = (elem){xi[i], yi[i], py[i], ci[i]};
  sort(a + 1, a + n + 1);
  B1.init(m), B2.init(m);
  Solve(1, m, 1, n);
  log("ans=%d\n", ans);
}
void Rotate() {
  for (int i = 1; i <= n; ++i) swap(xi[i], yi[i]), yi[i] = -yi[i];
}
int main() {
#ifdef memset0
  freopen("D.in", "r", stdin);
#endif
  // cin.tie(0)->sync_with_stdio(0);
  ans = INF;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> xi[i] >> yi[i] >> tc[i];
  for (int i = 0; i < 4; ++i) {
    log("`````````````````````ROT=%d\n", i);
    Calc(0, 1, 2);
    Calc(0, 2, 1);
    Calc(1, 0, 2);
    Calc(1, 2, 0);
    Calc(2, 0, 1);
    Calc(2, 1, 0);
    Rotate();
  }
  assert(ans >= 0);
  cout << (ans << 1) << "\n";
}