#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #define N 1001

 using namespace std;

 struct line

 {

     int l,r,c;

 }

     a[N];

 int f[N],n,ans;

 bool cmp(line x,line y)

 {

     return x.r<y.r;

 }

 int main()

 {

     int i,j;

     scanf("%d",&n);

     for (i=;i<=n;i++) scanf("%d%d%d",&a[i].l,&a[i].r,&a[i].c);

     sort(a+,a++n,cmp);

     for (i=;i<=n;i++)

     {

         for (j=;j<i;j++)

         {

             if (a[i].l>=a[j].r)

             {

                 f[i]=max(f[i],f[j]+a[i].c);

                 ans=max(f[i],ans);

             }

         }

     }

     printf("%d\n",ans);

     return ;

 }