#include "bits/stdc++.h"

using namespace std;
using i64 = long long;

i64 mod = 998244353;

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

i64 qpow(i64 a, i64 b) {
    i64 res = 1;
    while (b) {
        if (b & 1) res = mul(res, a);
        b /= 2;
        a = mul(a, a);
    }
    return res;
}

i64 inv(i64 x) {
    return qpow(x, mod - 2);
}

i64 add(i64 x, i64 y) {
    return (x + y) % mod;
}

i64 sub(i64 x, i64 y) {
    return (x - y + mod) % mod;
}


void solve() {
    int n;
    cin >> n;
    vector<tuple<i64, i64, i64>> arr;
    for (int i = 1; i <= n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        arr.emplace_back(x, y, z);
    }
    sort(arr.begin(), arr.end(), [&](auto a, auto b) {
        auto [x1, y1, z1] = a;
        auto [x2, y2, z2] = b;
        return x1 * z1 * y2 < x2 * z2 * y1;
    });
    i64 tim = 0;
    for (auto [x, y, z]: arr) {
//        cerr << x << " " << y << " " << z << endl;
        swap(y, z);
        tim = mul((mul(y, inv(z))),
                  add(tim, x));
    }
    cout << tim << endl;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}