// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(_,v.size())cout<<" "<<v[_];cout<<endl;
#define show2d(v) rep(_,v.size()){rep(__,v[_].size())cout<<" "<<v[_][__];cout<<endl;}cout<<endl;
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 1e18+10 : 1e9+10;
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};//RDLU
signed main(){
	int n;
	while(cin>>n,n){
		vvi dp(366,vi(366,-inf));
		dp[0][0]=0;
		vvp G(366);
		rep(i,n){
			int a,b,c;
			cin>>a>>b>>c;
			a--;
			G[a].pb({b,c});
		}
		rep(i,366){
			rep(k,G[i].size())for(int j=366-1;j>=i;j--){
				if(dp[i][j]+inf){
					int s=G[i][k].first,t=j;
					if(s>t)swap(s,t);
					cmax(dp[s][t],dp[i][j]+G[i][k].second);
					t++;
					if(t<366)cmax(dp[s][t],dp[i][j]+G[i][k].second);
				}
			}
			rep(j,366){
				if(i+1<365&&i!=j)cmax(dp[i+1][j],dp[i][j]);
				if(i+1<365&&i==j)cmax(dp[i+1][j+1],dp[i][j]);
			}
		}
//		rep(i,10){rep(j,6)cout<<" "<<dp[i][j];cout<<endl;}
		int out=-inf;
		rep(i,366)rep(j,366)cmax(out,dp[i][j]);
		cout<<out<<endl;
	}
}







