#include<bits/stdc++.h>
using namespace std;
const int MaxN = 102;
int n, a[MaxN], b[MaxN], g[MaxN], dp[MaxN], ans;
int solve(int i) {
if(dp[i] != -1) {
return dp[i];
}
dp[i] = g[i];
for(int j = 0; j < n; j ++) {
if(j == i) continue;
if((a[i] >= a[j] && b[i] >= b[j]) || (a[i] >= b[j] && b[i] >= a[j])) {
dp[i] = max(dp[i], g[i] + solve(j));
}
}
return dp[i];
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n;
for(int i = 0; i <n; i ++) {
cin >> a[i] >> b[i] >> g[i];
dp[i] = -1;
}
ans = 0;
for(int i = 0; i < n; i ++) {
ans = max(ans, solve(i));
}
cout << ans;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKY29uc3QgaW50IE1heE4gPSAxMDI7CmludCBuLCBhW01heE5dLCBiW01heE5dLCBnW01heE5dLCBkcFtNYXhOXSwgYW5zOwoKaW50IHNvbHZlKGludCBpKSB7CiAgICBpZihkcFtpXSAhPSAtMSkgewogICAgICAgIHJldHVybiBkcFtpXTsKICAgIH0KICAgIGRwW2ldID0gZ1tpXTsKICAgIGZvcihpbnQgaiA9IDA7IGogPCBuOyBqICsrKSB7CiAgICAgICAgaWYoaiA9PSBpKSBjb250aW51ZTsKICAgICAgICBpZigoYVtpXSA+PSBhW2pdICYmIGJbaV0gPj0gYltqXSkgfHwgKGFbaV0gPj0gYltqXSAmJiBiW2ldID49IGFbal0pKSB7CiAgICAgICAgICAgIGRwW2ldID0gbWF4KGRwW2ldLCBnW2ldICsgc29sdmUoaikpOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiBkcFtpXTsKfQoKaW50IG1haW4oKSB7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApO2Npbi50aWUoMCk7CiAgICBjaW4gPj4gbjsKICAgIGZvcihpbnQgaSA9IDA7IGkgPG47IGkgKyspIHsKICAgICAgICBjaW4gPj4gYVtpXSA+PiBiW2ldID4+IGdbaV07CiAgICAgICAgZHBbaV0gPSAtMTsKICAgIH0KICAgIGFucyA9IDA7CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSArKykgewogICAgICAgIGFucyA9IG1heChhbnMsIHNvbHZlKGkpKTsKICAgIH0KICAgIGNvdXQgPDwgYW5zOwp9Cg==