#include "bits/stdc++.h"
using namespace std;
const int Len = 5e5 + 5;
int n,m;
#define ull unsigned long long
ull fum[Len];//后缀和 
/*
sort(first key:a)
f_c:maintain the least vertical point which can meet the need to choose a subset's sum = c

*/
inline int read()
{
	int x = 0 , f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') 
	{
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while('0' <= ch && ch <= '9')
	{
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar();
	}
	return x * f;
}
void write(ull x)
{
	if(x < 0){putchar('-');write(-x);}
	if(x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
struct P
{
	int y,w;
	P(){y = w = 0;}
	P(int Y,int W){y = Y , w = W;}
};
vector<P> p[Len];
signed main()
{
	n = read();
	for(int i = 1 ; i <= n ; i ++) 
	{
		int x = read() , y = read() , w = read();
		p[x].push_back(P(y , w));
	}
	for(int i = n + 1 ; i >= 1 ; i --) fum[i - 1] = fum[i] + i - 1; 
	vector<int> f,g;
	f.resize(n) , g.resize(n);
	for(int i = 0 ; i < n ; i ++) f[i] = g[i] = n + 1;
	f[0] = 0;
	int mx = n + 1;ull sum = 0 , ans = 0;
	for(int i = 1 ; i <= n ; i ++)
	{
		const int SZ = (int)p[i].size();
		for(int j = 0 ; j < SZ ; j ++)
		{
			int y = p[i][j].y , w = p[i][j].w;
			if(y >= mx) continue;
			g = f , mx = 0;
			for(int o = 0 ; o < n ; o ++)
			{
				int to = (o + w) % n;
				g[to] = min(g[to] , max(y , f[o]));
			}
			sum = 0;
			for(int o = 0 ; o < n ; o ++)
			{
				mx = max(mx , g[o]);
				sum += fum[g[o]] * o;
			}
			f = g;
		}
		ans += sum * i;
	}
	write(ans);
	return 0;
}