#include<bits/stdc++.h>

using namespace std;

const int N = , inf = 0x3f3f3f3f;

struct edge {

    int nxt, to, f, c;

} e[N * ];

int n, m, k, source, sink, tot, cnt = , sum;

int head[N], pree[N], prev[N], vis[N], d[N];

inline void link(int u, int v, int f, int c)

{

    e[++cnt].nxt = head[u];

    head[u] = cnt;

    e[cnt].f = f;

    e[cnt].to = v;

    e[cnt].c = c;

}

inline void insert(int u, int v, int f, int c)

{

    link(u, v, f, c);

    link(v, u, , -c);

}

bool spfa()

{

    memset(d, -, sizeof(d));

    d[source] = ;

    queue<int> q;

    q.push(source);

    while(!q.empty())

    {

        int u = q.front();

        q.pop();

        vis[u] = ;

        for(int i = head[u]; i; i = e[i].nxt) if(e[i].f && (d[e[i].to] < d[u] + e[i].c || d[e[i].to] == -))

        {

            pree[e[i].to] = i;

            prev[e[i].to] = u;

            d[e[i].to] = d[u] + e[i].c;

            if(vis[e[i].to] == )

            {

                q.push(e[i].to);

                vis[e[i].to] = ;

            }

        }

    }

    return d[sink] != -;

}

inline int Edmonds_Karp()

{

    int ans = ;

    while(spfa())

    {

        int now = sink, delta = inf;

        while(now != source)

        {

            delta = min(delta, e[pree[now]].f);

            now = prev[now];

        }

        now = sink;

        while(now != source)

        {

            e[pree[now]].f -= delta;

            e[pree[now] ^ ].f += delta;

            now = prev[now];

        }

        ans += delta * d[sink];

    }

    return ans;

}

void build(int l, int r, int x)

{

    if(l == r)

    {

        insert(x, sink, , );

        return;

    }

    int mid = (l + r) >> ;

    build(l, mid, x << );

    build(mid + , r, x <<  | );

    insert(x, x << , inf, );

    insert(x, x <<  | , inf, );

}

void update(int l, int r, int x, int a, int b, int c, int pos)

{

    if(l > b || r < a) return;

    if(l >= a && r <= b)

    {

        insert(pos, x, , c);

        return;

    }

    int mid = (l + r) >> ;

    update(l, mid, x << , a, b, c, pos);

    update(mid + , r, x <<  | , a, b, c, pos);

}

int main()

{

    scanf("%d", &n);

    sink =  + n + ;

    build(, , );

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

    {

        int l, r, c;

        scanf("%d%d%d", &l, &r, &c);

        insert(source, i + , , );

        update(, , , l, r - , c, i + );

    }

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

    return ;

}