#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
using ull = unsigned long long;
const int N = 5e5 + 5;
int n;
int f[N], g[N];
ull res, ans, pre[N];
struct node{
    int x, y, w;
}nod[N];

int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> nod[i].x >> nod[i].y >> nod[i].w;
    }
    pre[n] = n;
    for(int i = n - 1; i; i --){
        pre[i] = pre[i + 1] + i;
    }
    sort(nod + 1, nod + 1 + n, [](node x, node y){
        return x.x < y.x;
    });
    int siz = 0, maxn = n + 1;
    f[0] = 0;
    for(int i = 1; i < n; i ++){
        f[i] = n + 1;
    }
    for(int i = 1, now = 1; i <= n; i ++){
        while(nod[now].x == i){
            if(siz != n || maxn > nod[now].y){
                maxn = 0; res = 0; siz = 0;
                for(int j = 0; j < n; j ++){
                    g[(j + nod[now].w) % n] = min(f[(j + nod[now].w) % n], max(f[j], nod[now].y));
                }
                for(int j = 0; j < n; j ++){
                    f[j] = g[j];
                    maxn = max(f[j], maxn);
                    res += j * pre[f[j]];
                    siz += (f[j] != n + 1);
                }
            }
            ++now;
        }
        // cout << "TEST!! \n";
        // for(int j = 0; j < n; j ++){
        //     cout << f[j] << ' ';
        // }
        // cout << res << endl;
        ans += res * i;
    }
    cout << ans << '\n';
    return 0;
}