#include <bits/stdc++.h>
using namespace std;

#define N 400010
#define PII pair<int,int>
#define PIP pair<int,PII>
PIP dashi[N];
PII times[N];
int cnt = 0;
int n;
int dp[N][2];
int t[N];
// priority_queue<PII,vector<PII>,greater<>> q;

// bool cmp(PIP a,PIP b) {
//     if(a.second == b.second) return a.first < b.first;
//     return a.second < b.second;
// }
bool cmp(PII a,PII b) {
    if(a.first == b.first) {
        return (a.second & 1) < (b.second & 1);
    }
    return a.first < b.first;
}
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> dashi[i].second.first >> dashi[i].second.second >> dashi[i].first;
        --dashi[i].second.second;
        times[i * 2 - 1].first = dashi[i].second.first;
        times[i * 2].first = dashi[i].second.second;
        times[i * 2 - 1].second = i * 2;
        times[i * 2].second = i * 2 + 1;
    }
    sort(times + 1,times + 1 + n * 2,cmp);
    for(int i = 1; i <= 2 * n; ++i) {
        if(times[i].first != times[i - 1].first) {
            ++cnt;
            t[cnt] = times[i].first;
        }
        if(times[i].second & 1) {
            dashi[times[i].second >> 1].second.second = cnt;
        }else {
            dashi[times[i].second >> 1].second.first = cnt;
        }
    }

    for(int i = 2; i <= cnt; ++i) {
        for(int x = 1; x <= n; ++x) {
            if(dashi[x].second.second < i) continue;
            for(int j = 1;j < i; ++j) {
                if(dashi[x].second.first > j) continue;
                dp[i][0] = max( dp[i][0],
                    dp[j][0] + (t[i] - t[j]) / dashi[x].first
                ); // 这一秒不用
                dp[i][0] = max(dp[i][0],
                    dp[j][1] + (t[i] - t[j] - 1) / dashi[x].first
                );
                dp[i][1] = max(dp[i][1],
                    dp[j][1] + (t[i] - t[j]) / dashi[x].first
                );
                dp[i][1] = max(dp[i][1],
                    dp[j][0] + (t[i] - t[j] + 1) / dashi[x].first
                );
            }
        }
    }

    int res = 0;
    for(int i = 1; i <= cnt; ++i) {
        res = max(res,dp[cnt][0]);
        res = max(res,dp[cnt][1]);
    }
    cout << res;

}