import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, std.bitmanip;

long MOD = 998244353;

void main() {
    auto N = readln.chomp.to!int;
    auto P = N.iota.map!(_ => readln.split.map!(to!long).array).array;
    P.sort();

    auto rev = P.map!(p => p[1]).array;
    rev = rev.dup.sort().uniq().array;
    int[long] comp;
    foreach (i; 0..rev.length.to!int) comp[rev[i]] = i;

    auto left = new SegmentTree!(int, (a,b)=>a+b, 0)(N);
    auto right = new SegmentTree!(int, (a,b)=>a+b, 0)(N);
    foreach (i; 0..N) right.add(i, 1);

    long lc = 0;
    long rc = N;
    long ans = 0;

    foreach (p; P) {
        right.add(comp[p[1]], -1);
        rc -= 1;

        long tmp = powmod(2, N, MOD) - 1;
        tmp -= powmod(2, lc, MOD) - 1;
        tmp -= powmod(2, rc, MOD) - 1;

        long ld = left.query(0, comp[p[1]]);
        long rd = right.query(0, comp[p[1]]);
        long lu = left.query(comp[p[1]], N-1);
        long ru = right.query(comp[p[1]], N-1);

        tmp -= (powmod(2, ld, MOD) - 1) * (powmod(2, rd, MOD) - 1) % MOD;
        tmp -= (powmod(2, lu, MOD) - 1) * (powmod(2, ru, MOD) - 1) % MOD;

        tmp = (tmp % MOD + MOD) % MOD;
        (ans += tmp) %= MOD;

        left.add(comp[p[1]], 1);
        lc += 1;
    }

    ans.writeln;
}

long powmod(long a, long p, long m) {
    long ret = 1;
    while (p > 0) {
        if (p % 2) ret = ret * a % m;
        a = a * a % m;
        p /= 2;
    }
    return ret;
}


class SegmentTree(T, alias op, T e) {
    T[] table;
    int size;
    int offset;

    this(int n) {
        size = 1;
        while (size <= n) size <<= 1;
        size <<= 1;
        table = new T[](size);
        fill(table, e);
        offset = size / 2;
    }

    void assign(int pos, T val) {
        pos += offset;
        table[pos] = val;
        while (pos > 1) {
            pos /= 2;
            table[pos] = op(table[pos*2], table[pos*2+1]);
        }
    }

    void add(int pos, T val) {
        pos += offset;
        table[pos] += val;
        while (pos > 1) {
            pos /= 2;
            table[pos] = op(table[pos*2], table[pos*2+1]);
        }
    }

    T query(int l, int r) {
        return query(l, r, 1, 0, offset-1);
    }

    T query(int l, int r, int i, int a, int b) {
        if (b < l || r < a) {
            return e;
        } else if (l <= a && b <= r) {
            return table[i];
        } else {
            return op(query(l, r, i*2, a, (a+b)/2), query(l, r, i*2+1, (a+b)/2+1, b));
        }
    }
}
