#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>

#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

template<int mod> struct mint {
    long long x;
    mint(long long x = 0) : x(x % mod) {
    }

    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) {
            x -= mod;
        }
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) {
            x -= mod;
        }
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(long long t) const {
        if (!t) {
            return 1;
        }
        mint a = pow(t>>1);
        a *= a;
        if (t&1) {
            a *= *this;
        }
        return a;
    }

    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};

template <class T=long long> class CoordinateCompression {
public:
    int no = 0;
    std::unordered_map<T, int> zip;    // 元の値 -> 圧縮した値
    std::unordered_map<int, T> unzip;  // 圧縮した値 -> 元の値

    CoordinateCompression() {
    }

    CoordinateCompression(const std::vector<T> &v) {
        this->build(v);
    }

    CoordinateCompression(const std::set<T> &v) {
        this->build(v);
    }

    void build(const std::vector<T> &v) {
        std::set<T> s(v.begin(), v.end());
        this->build(s);
    }

    void build(const std::set<T> &s) {
        for (auto x : s) {
            this->zip[x] = this->no;
            this->unzip[this->no] = x;
            this->no++;
        }
    }
};

template <class T=long long> class FenwickTree {
public:
    const int n;
    std::vector<T> v;

    FenwickTree(int n) : n(n) {
        this->v.assign(n + 1, 0);
    }

    T access(int i) {
        return this->sum(i, i + 1);
    }

    // sum(v[0, i))
    T sum(int i) {
        assert(0 <= i && i <= this->n);

        T s = 0;
        i -= 1;
        while (i >= 0) {
            s += this->v[i];
            i = (i & (i + 1)) - 1;
        }
        return s;
    }

    // sum(v[left, right))
    T sum(int left, int right) {
        assert(left <= right);
        return this->sum(right) - this->sum(left);
    }

    // v[i] += x(0-origin)
    void add(int i, long long x) {
        assert(i < this->n);

        while (i < this->n) {
            this->v.at(i) += x;
            i |= i + 1;
        }
    }
};

// 各点について，左上，左下，右上，右下の点の数を求める
std::vector<tuple<int, int, int, int>> line_sweep(const vector<int> &y, const vector<int> &x) {
    const int N = y.size();
    vector<tuple<int, int, int, int>> ans(N);

    // 左上，左下
    {
        FenwickTree<LL> ft(N);
        for (int i = 0; i < N; ++i) {
            const auto num = ft.sum(y[i]);
            std::get<0>(ans[i]) = i - num;
            std::get<1>(ans[i]) = num;
            ft.add(y[i], 1);
        }
    }

    // 右上，右下
    {
        FenwickTree<LL> ft(N);
        for (int i = N - 1; i >= 0; --i) {
            const auto num = ft.sum(y[i]);
            std::get<2>(ans[i]) = (N - i - 1) - num;
            std::get<3>(ans[i]) = num;
            ft.add(y[i], 1);
        }
    }

    return ans;
}

const LL mod = 998244353;

// 点を含む部分集合の個数
mint<mod> f(int a, int b, int c, int d, int N) {
    mint<mod> ans = 0;

    vector<int> num = {a, b, c, d};
    FOR(b, 0, 1 << 4) {

        mint<mod> count = 1;
        bool up = false, down = false, left = false, right = false;
        FOR(i, 0, 4) {
            if (IS_BIT_ON(b, i)) {
                count *= (mint<mod>(2).pow(num[i]) - 1);
                if (i == 0) { up = left = true; }   // 左上
                if (i == 1) { down = left = true; } // 左下
                if (i == 2) { up = right = true; }  // 右上
                if (i == 3) { down = right = true; }// 右下
            }
        }
        if (up and down and left and right) {
            ans += count;
        }
    }

    ans += mint<mod>(2).pow(N - 1);
    return ans;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N;
    cin >> N;
    auto X = make_v<LL>(N);
    auto Y = make_v<LL>(N);
    FOR(i, 0, N) {
        cin >> X[i] >> Y[i];
    }

    CoordinateCompression<LL> cc_y, cc_x;
    cc_y.build(Y);
    cc_x.build(X);

    vector<pair<LL, LL>> points;
    FOR(i, 0, N) {
        points.emplace_back(make_pair(cc_x.zip[X[i]], cc_y.zip[Y[i]]));
    }
    sort(ALL(points));

    auto x = make_v<int>(N);
    auto y = make_v<int>(N);
    FOR(i, 0, N) {
        x[i] = points[i].first;
        y[i] = points[i].second;
    }

    auto dot = line_sweep(y, x);

    mint<mod> ans = 0;
    FOR(i, 0, N) {
        int a, b, c, d;
        tie(a, b, c, d) = dot[i];
        ans += f(a, b, c, d, N);
    }

    print(ans.x);

    return 0;
}


Measured memory_bytes: 47376