#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstring>

#define pb push_back
#define mp make_pair
#define fi first
#define se second

typedef long long LL;

using namespace std;

template <typename T> void inline chkMax(T &x, T y) { if (y > x) x = y; }
template <typename T> void inline chkMin(T &x, T y) { if (y < x) x = y; }


template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

template <typename T> void print(T x) {
	if (x < 0) { putchar('-'); print(x); return ; }
    if (x >= 10) print(x / 10);
    putchar((x % 10) + '0');
}

const int N = 505, INF = 0xcfcfcfcf;

int n, C[N], A[N], V[N], ans = INF;

int f[N][N][N];

int main() {
	memset(f, 0xcf, sizeof f);
	read(n);
	for (int i = 1; i <= n; i++) {
		read(C[i]), read(A[i]), read(V[i]);
	}
	f[2][3][1] = V[1];
	f[1][2][3] = V[3];
	for (int i = 0; i <= n + 2; i++) {
		for (int j = 0; j <= n + 2; j++) {
			if (i && i == j) continue;
			for (int k = 0; k <= n + 2; k++) {
				if (f[i][j][k] == INF) continue;
				chkMax(ans, f[i][j][k]);
				int v = f[i][j][k];
				if (k > j) {
					if (C[i] == C[k] || A[i] == A[k]) chkMax(f[j][k + 1][i], v + V[i]);
					if (k < n && (C[k + 1] == C[k] || A[k + 1] == A[k]))
						chkMax(f[i][j][k + 1], v + V[k + 1]);
				}
				// flag
				if (k < i) {
					if (C[k] == C[i] || A[k] == A[i])
						chkMax(f[j][j + 1][i], v + V[i]);
					if (j < n && (C[j + 1] == C[k] || A[j + 1] == A[k]))
						chkMax(f[i][j][j + 1], v + V[j + 1]);
				}
			}
		}
	}
	printf("%d\n", ans);
}