#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}

namespace po167{
struct combination{
	int upper;
	long long MOD;
	std::vector<long long> fact;
	std::vector<long long> rev;
	std::vector<long long> fact_rev;
	combination(int max,long long mod):upper(max),MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){
		for(long long i=0;i<=max;i++){
			if(i<2){
				fact[i]=1;
				fact_rev[i]=1;
				rev[i]=1;
				continue;
			}
			fact[i]=(fact[i-1]*i)%mod;
			rev[i]=mod-((mod/i)*rev[mod%i])%mod;
			fact_rev[i]=(fact_rev[i-1]*rev[i])%mod;
		}
	}
	long long Comb(int x,int y){
		assert(upper>=x);
		if (x<y||y<0||x<0) return 0;
		return (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;
	}
	long long P(int x,int y){
		assert(upper>=x);
		if (x<y||y<0||x<0) return 0;
		return (fact_rev[x-y]*fact[x])%MOD;
	}
};
}
using po167::combination;

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



combination table(200'200,mod);

namespace po167{
struct Mo{
	std::vector<int> left,right,order;
	int width,nl,nr,index;
	Mo(int n):width((int) std::sqrt(n)),nl(0),nr(0),index(0){}

	//[l,r)
	void insert(int l,int r){
		assert(l<=r);
		left.push_back(l);
		right.push_back(r);
	}

	void bulid(){
		order.resize((int)left.size());
		std::iota(order.begin(),order.end(),0);
		std::sort(order.begin(),order.end(),[&](int a,int b){
			if(left[a]/width!=left[b]/width){
				return left[a]>left[b];
			}
			else if((left[a]/width)&1){
				return right[a]<right[b];
			}
			return right[a]>right[b];
		});
	}
	int process(){
		int now=order[index];
		while(nr<right[now]) add(nr,nl,1),nr++;
		while(nl>left[now]) del(nr,nl,2),nl--;
		while(nl<left[now]) add(nr,nl,2),nl++;
		while(nr>right[now]) del(nr,nl,1),nr--;
		index++;
		return now;
	}
	void add(int,int,int);
	void del(int,int,int);
};
}
using po167::Mo;

ll ans=1;
ll rev=(mod+1)/2;

void Mo::add(int a,int b,int t){
	//cout<<"+ "<<a<<" "<<b<<" "<<t<<" "<<ans<<"\n";
	if(t==1){
		if(a+1<b) ans=0;
		if(a+1==b) ans=jyo(2,a+1,mod);
		if(a+1>b) ans=(ans*2ll-table.Comb(a,b))%mod;
	}else{
		if(a<b+1) ans=0;
		else ans+=table.Comb(a,b+1),ans%=mod;
	}
}
void Mo::del(int a,int b,int t){
	//cout<<"- "<<a<<" "<<b<<" "<<t<<" "<<ans<<"\n";
	if(t==1){
		if(a-1<b) ans=0;
		else ans=((ans+table.Comb(a-1,b))*rev)%mod;
	}else{
		if(a<b-1) ans=0;
		if(a==b-1) ans=jyo(2,a,mod);
		if(a>b-1) ans-=table.Comb(a,b),ans%=mod;
	}
}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int T;
	cin>>T;
	vector<pair<int,int>> p(T);
	rep(i,0,T) cin>>p[i].first>>p[i].second,p[i].first--,p[i].second--;
	Mo M(T);
	rep(i,0,T) M.insert(p[i].second,p[i].first);
	M.bulid();
	vector<ll> val(T);
	rep(i,0,T){
		int a=M.process();
		val[a]=(ans*(jyo(2,p[a].first+1,mod)-1))%mod;
		val[a]=(val[a]+mod)%mod;
	}
	rep(i,0,T) cout<<val[i]<<"\n";
}