You are appointed director of a famous concert hall, to save it from bankruptcy. The hall is very popular, and receives many requests to use its two fine rooms, but unfortunately the previous director was not very efficient, and it has been losing money for many years. The two rooms are of the same size and arrangement. Therefore, each applicant wishing to hold a concert asks for a room without specifying which. Each room can be used for only one concert per day.

In order to make more money, you have decided to abandon the previous fixed price policy, and rather let applicants specify the price they are ready to pay. Each application shall specify a period [i, j] and an asking price w, where i and j are respectively the first and last days of the period (1 ≤ i ≤ j ≤ 365), and w is a positive integer in yen, indicating the amount the applicant is willing to pay to use a room for the whole period.

You have received applications for the next year, and you should now choose the applications you will accept. Each application should be either accepted for its whole period or completely rejected. Each concert should use the same room during the whole applied period.

Considering the dire economic situation of the concert hall, artistic quality is to be ignored, and you should just try to maximize the total income for the whole year by accepting the most profitable applications.



Input

The input has multiple data sets, each starting with a line consisting of a single integer n, the number of applications in the data set. Then, it is followed by n lines, each of which represents one application with a period [i, j] and an asking price w yen in the following format.


i j w


A line containing a single zero indicates the end of the input.

The maximum number of applications in a data set is one thousand, and the maximum asking price is one million yen.

Output

For each data set, print a single line containing an integer, the maximum total income in yen for the data set.

Example

Input

4
1 2 10
2 3 10
3 3 10
1 3 10
6
1 20 1000
3 25 10000
5 15 5000
22 300 5500
10 295 9000
7 7 6000
8
32 251 2261
123 281 1339
211 235 5641
162 217 7273
22 139 7851
194 198 9190
119 274 878
122 173 8640
0


Output

30
25500
38595
#include <algorithm>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

typedef int weight;
typedef pair<weight, int> P;
constexpr weight EPS = 1e-8;

class edge {
public:
	int to;
	int cap;
	weight cost;
	int rev;
	edge(int to_, int cap_, weight cost_, int rev_):to(to_), cap(cap_), cost(cost_), rev(rev_){};
};

vector<vector<edge> > G;

void init(int V) {
	G.assign(V, vector<edge>());
}

void add_edge(int from, int to, int cap, weight cost) {
	G[from].emplace_back(to, cap, cost, G[to].size());
	G[to].emplace_back(from, 0, -cost, G[from].size() - 1);
}

weight min_cost_flow(int s, int t, int f) {
	const int n = G.size();
	weight res = 0;
	vector<int> prevv(n), preve(n);
	vector<weight> h(n, 0);
	while(f > 0) {
		priority_queue<P, vector<P>, greater<P> > que;
		vector<weight> dist(n, INT_MAX);
		dist[s] = 0;
		que.push({0, s});
		while(!que.empty()) {
			const int d = que.top().first;
			const int v = que.top().second;
			que.pop();

			if(dist[v] < d) continue;

			for(unsigned i = 0; i < G[v].size(); ++i) {
				const edge &e = G[v][i];
				if(e.cap > 0 && dist[e.to] > d + e.cost + h[v] - h[e.to] + EPS) {
					dist[e.to] = d + e.cost + h[v] - h[e.to];
					prevv[e.to] = v;
					preve[e.to] = i;
					que.push({dist[e.to], e.to});
				}
			}
		}

		if(dist[t] == INT_MAX) return -1;

		for(int v = 0; v < n; ++v) {
			h[v] += dist[v];
		}

		int d = f;
		for(int v = t; v != s; v = prevv[v]) {
			d = min(d, G[prevv[v]][preve[v]].cap);
		}

		f -= d;
		res += d * h[t];
		for(int v = t; v != s; v = prevv[v]) {
			edge &e = G[prevv[v]][preve[v]];
			e.cap -= d;
			G[v][e.rev].cap += d;
		}
	}

	return res;
}

constexpr int NUMBER_OF_DAYS = 365;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	for(int n; cin >> n && n;) {
		init(NUMBER_OF_DAYS + 1);
		for(int i = 0; i < NUMBER_OF_DAYS; ++i) {
			add_edge(i, i + 1, 2, 0);
		}

		for(int i = 0; i < n; ++i) {
			int l, r, w;
			cin >> l >> r >> w;
			add_edge(l - 1, r, 1, -w);
		}

		cout << -min_cost_flow(0, NUMBER_OF_DAYS, 2) << endl;
	}

	return EXIT_SUCCESS;
}