#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};

const ll mod = 998244353;
ll qpow(ll a, ll b)
{
    ll ans = 1;
    a %= mod;
    for (; b; b >>= 1) {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
    }
    return ans % mod;
}
void solve()
{
    int n;
    cin >> n;
    vector<int> a(n + 5), b(n + 5), t(n + 5);

    for (int i = 1; i <= n; ++i) {
        cin >> t[i] >> a[i] >> b[i];
    }

    vector<int> v;
    for (int i = 1; i <= n; ++i)
        v.push_back(i);

    sort(range(v), [&](const auto &i, const auto &j) {
        return 1ll * t[i] * b[i] * (b[j] - a[j]) < 1ll * t[j] * b[j] * (b[i] - a[i]);
    });

    ll ans = 0;
    ll tag = 1;
    ll sum = 0;
    for (int i = 1; i <= n; ++i) {
        int idx = v[i - 1];
        sum += t[idx];
        ll p = 1ll * a[idx] * qpow(b[idx], mod - 2) % mod;
        // cout << idx << '\n';
        (ans += tag * (mod - p + 1) % mod * sum % mod) %= mod;
        (tag *= p) %= mod;
    }

    (ans += tag * sum) %= mod;
    (ans *= qpow(tag, mod - 2)) %= mod;
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}