#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define dame { cout << "No" << endl; return;} #define dame1 { cout << -1 << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"< fact, ifact; combination(int n):fact(n+1),ifact(n+1) { fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } } com(10000005); void solve(){ int n; cin>>n; vl bb(n),cc(n); rep(i,n) cin>>bb[i]>>cc[i]; if (n==1){ cout << 0 << endl; return; } map mp; rep(i,n) mp[bb[i]] = 0; rep(i,n) mp[cc[i]] = 0; int m = 0; fore(y , mp) y.se = m++; vpll v; rep(i,n) v.pb({cc[i],bb[i]}); sort(rrng(v)); fenwick_tree fw1(m),fw2(m); mint ans = 0; mint sump = 1; rep(i,n) sump *= (cc[i]-bb[i]+1); rep(i,n){ int ic = mp[v[i].fi]; int ib = mp[v[i].se]; ll b = v[i].se; ll c = v[i].fi; mint coef = sump/(c-b+1); ans += fw1.sum(ib,ic+1)*(c+1)*coef; ans -= fw2.sum(ib,ic+1)*coef; ans += fw1.sum(0,ib)*(c-b+1)*coef; fw1.add(ib,mint(1)/(c-b+1)); fw2.add(ib,mint(b)/(c-b+1)); } // outm; ans *= -1; ans += sump*n*(n-1)/2; // mint sum = 0; mint tmp = 0; // rep(i,n){ // mint cb = cc[i]-bb[i]+1; // sum += cb; // tmp -= cb*cb; // } // tmp += (sum*sum); // tmp /= 2; ans += tmp; // outm; ans *= com.fact[n-2]*com(n,2); tmp = 1; rep(i,n) tmp *= (cc[i]-bb[i]+1); ans /= tmp; outm; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }