#include <bits/stdc++.h>

typedef unsigned int u32;
typedef long long i64;
typedef unsigned long long u64;
typedef __int128 i128;
typedef long double db;
const db EPS = 1E-12;
inline int sgn(db x) { return x <= -EPS ? -1 : (x >= EPS); }
// ~~ SEG STARST
// ~~ SEG END

void solve() {
	int n; std::cin >> n;
	std::vector<std::vector<std::array<int, 2> > > point(n + 1);
	for (int i = 1; i <= n; i++) {
		int x, y, w; std::cin >> x >> y >> w;
		point[x].push_back({y, w});
	}

	std::vector<int> f(n, n + 1);
	f[0] = 0;
	std::vector<int> g(n, n + 1);

	u64 ans = 0, sum = 0;
	for (int i = 1, mx = n + 1; i <= n; i++) {
		for (auto yw : point[i]) if (yw[0] < mx) {
			int y = yw[0], w = yw[1];
			g = f;
			for (int c = 0; c <= n - 1; c++) {
				int nxtc = c + w >= n ? c + w - n : c + w;
				g[nxtc] = std::min(g[nxtc], std::max(f[c], y));
			}
			
			sum = 0, mx = 0;
			for (int c = 0; c <= n - 1; c++) {
				f[c] = g[c];
				mx = std::max(mx, f[c]);
				if (f[c] != n + 1) {
					sum += u64(c) * (u64(n) * (n + 1) - u64(f[c]) * (f[c] - 1)) / 2;
				}
			}
		}
		ans += sum * i;
	}
	std::cout << ans << "\n";
}
signed main() {
#ifdef Supper_Dragon_Baby
freopen("IO/in", "r", stdin); freopen("IO/out", "w", stdout);
#endif 
	std::cin.tie(0); std::cout.tie(0); std::ios::sync_with_stdio(false);
	int _ = 1; //std::cin >> _;
	while (_--) { solve(); }
	return 0;
}