#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void solve();

bool comp(const tuple<ll, ll, ll>& a, const tuple<ll, ll, ll>& b) {
	return get<0>(a) * get<1>(a) * get<2>(b) < get<0>(b) * get<1>(b) * get<2>(a);
}

constexpr int mod = 998244353;

ll add(ll a, ll b) {
	return a + b >= mod ? a + b - mod : a + b;
}

ll sub(ll a, ll b) {
	return a >= b ? a - b : a - b + mod;
}

ll mul(ll a, ll b) {
	return a * b % mod;
}

ll bin_pow(ll a, ll x) {
	ll res = 1;
	while (x) {
		if (x & 1) {
			res = mul(res, a);
		}
		a = mul(a, a);
		x >>= 1;
	}
	return res;
}

ll inv(ll a) {
	return bin_pow(a, mod - 2);
}

int32_t main() {
	int n;
	cin >> n;
	vector<ll> t(n), a(n), b(n);
	vector<tuple<ll, ll, ll>> ar(n);
	for (int i = 0; i < n; i++) {
		cin >> t[i];
		cin >> a[i] >> b[i];
		a[i] = b[i] - a[i];
		ar[i] = {t[i], a[i], b[i]};
	}
	sort(ar.begin(), ar.end(), comp);
	for (int i = 0; i < n; i++) {
		t[i] = get<0>(ar[i]);
		a[i] = get<1>(ar[i]);
		b[i] = get<2>(ar[i]);
	}
	vector<ll> prob(n + 1), pref(n + 1);
	prob[0] = mul(a[0], inv(b[0]));
	pref[0] = t[0];
	ll pr = mul(b[0] - a[0], inv(b[0]));
	for (int i = 1; i < n; i++) {
		prob[i] = mul(pr, mul(a[i], inv(b[i])));
		pref[i] = add(pref[i - 1], t[i]);
		pr = mul(pr, mul(b[i] - a[i], inv(b[i])));
	}
	prob[n] = pr;
	pref[n] = pref[n - 1];
	ll e = 0;
	for (int i = 0; i < n; i++) {
		e = add(e, mul(prob[i], pref[i]));
	}
	if (pr == 1) {
		cout << pref[n] << '\n';
		return 0;
	}
	// e = mul(e, inv(sub(1, pr)));
	cout << add(pref[n], mul(e, inv(pr))) << '\n';
}