#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
#define ll long long
struct qq{
    ll t,a,b;
    bool operator < (const qq &e) const{
        return e.b*(b*t+a*e.t)<b*(e.b*e.t+e.a*t);
    }
}z[201000];
int n;
int qpow(int a,int b){
    int c=1;
    for(;b;b>>=1){
        if(b&1)c=1ll*a*c%mod;
        a=1ll*a*a%mod;
    }
    return c;
}
int main(){
    scanf("%d",&n);
    ll all=0,as=0;
    bool fl=1;
    for(int i=1;i<=n;i++)
    scanf("%lld%lld%lld",&z[i].t,&z[i].a,&z[i].b),(as+=z[i].t)%=mod,
    fl&=(z[i].a==z[i].b);
    if(fl){
        printf("%lld",as);
        return 0;
    }
    sort(z+1,z+n+1);
    ll p=1,su=0;
    for(int i=1;i<=n;i++){
        (su+=1ll*p*z[i].t%mod)%=mod;
        p=1ll*p*z[i].a%mod*qpow(z[i].b,mod-2)%mod;
    }
    su=1ll*su*qpow(1-p,mod-2)%mod;
    (all+=1ll*(qpow(p,mod-2)-1)*su%mod)%=mod;
    (all+=mod)%=mod;
    printf("%lld",all);
    return 0;
}