#pragma GCC optimize("O3,unroll-loops,inline")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

constexpr int mod = 998244353;

int bp(int a, int b = mod - 2) {
    if (b == 0)
        return 1;
    int c = bp(a, b / 2);
    c = 1ll * c * c % mod;
    if (b % 2)
        c = 1ll * c * a % mod;
    return c;
}

void solve() {
    int n;
    cin >> n;
    vector<pair<pair<int, int>, int>> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].ss >> a[i].ff.ff >> a[i].ff.ss;
    }
    sort(all(a), [&](pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
        auto t1 = a.ss, t2 = b.ss;
        auto a1 = a.ff.ff, b1 = a.ff.ss, a2 = b.ff.ff, b2 = b.ff.ss;
        long double r1 = 1.0 * t1 * b1 / a1 * b2 / a2 + t2 * b2 / a2, r2 = 1.0 * t2 * b2 / a2 * b1 / a1 + t1 * b1 / a1;
        return r1 < r2;
    });
    int ans = 0;
    for (auto i: a)
        ans = 1ll * (ans + i.ss) * i.ff.ss % mod * bp(i.ff.ff) % mod;
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    while (t--)
        solve();
}