#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;

#if !ONLINE_JUDGE
#define debug
#endif

using namespace std;
 
/*******  All Required define Pre-Processors and typedef Constants *******/
#define mem(a, b) memset(a, (b), sizeof(a))
#define repd(i,k) for(int i=k;i>=0;i--)
#define rep(i,k) for(int i=0;i<k;i++)
#define repn(i,k1,k2) for(ll i=k1;i<k2;i++)
#define sz(x) (ll)(x).size()
#define ff first
#define ss second

#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF (ll)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 998244353
#define ee6 (ll)1000001
#define ee5 (ll)100001

#define trav(a, v) for(auto& a : v)

#define tt ll t;cin>>t; while(t--)
typedef long long int ll;
 
typedef pair<ll, ll> pr;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pr> vpr;
typedef vector<vpr>vvpr;
typedef vector<vi> vvi;

//*X.find_by_order(2) element at index=2
//X.order_of_key(1) how many elements strictly less than 1

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;

#ifdef debug
#define dbg(...) { cerr<<"[ "; dump(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.ff<<","<<x.ss<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const unordered_map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
} 
 
template <typename Arg1>
void dump(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void dump(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    dump(names.substr(1+(int)name.size()), args...);
}
#else
    #define dbg(args...)
#endif
 
ll powmod(ll x, ll y) 
{ 
    ll res = 1;  
    x = x % MOD;
    while (y > 0) 
    { 
        if (y & 1) 
            res = (res*x) % MOD; 
        y = y>>1; // y = y/2 
        x = (x*x) % MOD;   
    } 
    return res; 
} 
ll pow2[2*ee5];
ll ans[2*ee5];
ll x[2*ee5],y[2*ee5];
vector<pair<ll,ll> >X,Y;
map<ll,pr>G;
int main()
{
    #if !ONLINE_JUDGE
   // freopen("in.txt","r",stdin);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    pow2[0]=1;
    for(ll i=1;i<=2*ee5;i++)
        pow2[i]=(pow2[i-1]*2)%MOD;
    ordered_set<ll>OST;
    
    ll n;cin>>n;
    
    rep(i,n){
        cin>>x[i]>>y[i];
        X.eb(x[i],y[i]);
        Y.eb(y[i],x[i]);
        G[x[i]]={y[i],i};
    }

    sort(all(X));
    sort(all(Y));


    rep(i,n){
        ll T1=X.end()-upper_bound(all(X),mp(x[i],INF+1));        
        ans[i]=pow2[T1]-1;
        ll T2=Y.end()-upper_bound(all(Y),mp(y[i],INF+1));
        ans[i]+=pow2[T2]-1;
        ll T3=lower_bound(all(X),mp(x[i],-INF-1))-X.begin();
        ans[i]+=pow2[T3]-1;
        ll T4=lower_bound(all(Y),mp(y[i],-INF-1))-Y.begin();
        ans[i]+=pow2[T4]-1;
        //cout<<x[i]<<" "<<y[i]<<" "<<ans[i]<<"\n";
    }

    

    for(auto e:G){                    
        ans[e.ss.ss]-=pow2[OST.order_of_key(e.ss.ff)]-1;                 
        ans[e.ss.ss]-=pow2[(OST.size()-OST.order_of_key(e.ss.ff+1))]-1;        
        OST.insert(e.ss.ff);
    }

    OST.clear();
    for(auto it=G.rbegin();it!=G.rend();it++){    
        ans[it->ss.ss]-=pow2[OST.order_of_key(it->ss.ff)]-1;                 
        ans[it->ss.ss]-=pow2[(OST.size()-OST.order_of_key(it->ss.ff+1))]-1;                
        OST.insert(it->ss.ff);
    }
    ll ANS=0;
    rep(i,n){ans[i]=(pow2[n]-ans[i]-1);ANS=((ANS+ans[i])%MOD+MOD)%MOD;}
    cout<<ANS;
}   

Measured memory_bytes: 39640