#include <bits/stdc++.h>
#define N 100005
using namespace std;

const int inf = 0x3f3f3f3f;
int n, ans, srt[N], mx;
struct node {
	int x, y, c;
} a[N], b[N];

struct BIT {
	int tr[N];
	void init() { memset(tr,0x3f,sizeof(tr)); }
	void upd(int x, int v) { for(;x<=mx;x+=x&-x)tr[x]=min(tr[x],v); }
	int qry(int x) { int r=inf;for(;x;x-=x&-x)r=min(r,tr[x]);return r; }
} T0, T1;
struct segtree {
	int L[N<<2], R[N<<2], V[N<<2]; 
	void build(int p, int l, int r) {
		L[p] = R[p] = V[p] = inf;
		if (l == r) return;
		int mid = (l+r)>>1;
		build(p<<1,l,mid); build(p<<1|1,mid+1,r);
	}
	inline void pushtg(int p, int vl, int vr) {
		V[p] = min(V[p], L[p]+vr); 
		L[p] = min(L[p], vl); R[p] = min(R[p], vr); 
	} 
	inline void pushdw(int p) {
		pushtg(p<<1,L[p],R[p]); 
		pushtg(p<<1|1,L[p],R[p]);
//		R[p] = inf;
	}
	void upd(int p, int l, int r, int x, int y, int vl, int vr) {
		if (x <= l && r <= y) return pushtg(p, vl, vr);
		pushdw(p); int mid = (l+r)>>1;
		if (x <= mid) upd(p<<1,l,mid,x,y,vl,vr);
		if (mid < y) upd(p<<1|1,mid+1,r,x,y,vl,vr);
	}
	int qry(int p, int l, int r, int x) {
		if (l == r) return V[p];
		pushdw(p); int mid = (l+r)>>1;
		if (x <= mid) return min(V[p],qry(p<<1,l,mid,x));
		else return min(V[p],qry(p<<1|1,mid+1,r,x));
	}
} T;

void solve() {
	for (int i = 1; i <= n; i++) srt[i] = a[i].y;
	sort(srt+1, srt+n+1); mx = unique(srt+1, srt+n+1)-srt-1;
	for (int i = 1; i <= n; i++) a[i].y = lower_bound(srt+1,srt+mx+1,a[i].y)-srt;
	sort(a+1, a+n+1, [&](node _,node __){ return _.x!=__.x?_.x<__.x:_.y<__.y; });
	T0.init(); T1.init(); T.build(1,1,mx);
	
	for (int i = 1; i <= n; i++) {
		if (a[i].c == 0) T0.upd(a[i].y, -a[i].x-srt[a[i].y]);
		else if (a[i].c == 1) T1.upd(a[i].y, T0.qry(a[i].y));
		else ans = min(ans, a[i].x+srt[a[i].y]+T1.qry(a[i].y));
		
		if (a[i].c == 0) T.upd(1,1,mx,a[i].y,mx,-a[i].x-srt[a[i].y],inf);
		else if (a[i].c == 1) T.upd(1,1,mx,1,a[i].y,inf,srt[a[i].y]);
		else ans = min(ans, T.qry(1,1,mx,a[i].y)+a[i].x);
	}
}

int main() {
	scanf("%d", &n); 
	for (int i = 1; i <= n; i++) {
//		int x, y; char c;
//		scanf("%d %d %c", &x, &y, &c);
//		b[i] = (node){x,y,c=='I'?0:c=='O'?1:2};
		scanf("%d %d %d", &b[i].x, &b[i].y, &b[i].c);
	}
	ans = inf;
	for (int tt = 0; tt < 4; tt++) {
		int o[3] = {0,1,2};
		do {
			for (int i = 1; i <= n; i++) {
				a[i] = b[i]; a[i].c = o[a[i].c];
			}
			solve();
		} while (next_permutation(o,o+3));	
		for (int i = 1; i <= n; i++) {
			swap(b[i].x, b[i].y);
			b[i].y = 100000000-b[i].y;
		}
	}
	printf("%d\n", ans*2); 
	return 0;
}