// ReSharper disable ArrangeTypeMemberModifiers
// ReSharper disable ConvertIfStatementToSwitchStatement
// ReSharper disable FunctionRecursiveOnAllPaths
// ReSharper disable InconsistentNaming
// ReSharper disable InlineOutVariableDeclaration
// ReSharper disable InvertIf
// ReSharper disable JoinDeclarationAndInitializer
// ReSharper disable MemberCanBeMadeStatic.Global
// ReSharper disable MemberCanBeMadeStatic.Local
// ReSharper disable NonReadonlyMemberInGetHashCode
// ReSharper disable PossibleNullReferenceException
// ReSharper disable RedundantUsingDirective
// ReSharper disable SuggestVarOrType_BuiltInTypes
// ReSharper disable SuggestVarOrType_Elsewhere
// ReSharper disable TailRecursiveCall
// ReSharper disable UnusedMember.Global
// ReSharper disable UnusedMember.Local
// ReSharper disable UseObjectOrCollectionInitializert

#if true && UTAKA_LOCAL

//#if false
#define UTAKA_DEBUG
#endif

using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using System.Numerics;
using System.Runtime.InteropServices;
using System.Security.Cryptography;

namespace UtakaApp
{
    public partial class Program
    {
        /*
        https://atcoder.jp/contests/abc136/tasks/abc136_f
        */
//F - Enclosed Points
//実行時間制限: 2 sec / メモリ制限: 1024 MB
//
//配点 : 600 点 
//
//問題文
//2 次元平面上の N 個の点からなる集合 S があり、 i 番目の点の座標は ( x i , y i) です。 N 個の点の x 座標、 y 座標はそれぞれ相異なります。 
//S の空でない部分集合 T に対して f ( T) を、各辺が座標軸と平行であって T の点を全て含むような最小の長方形に含まれる点の個数として定義します。より正確には、
//f ( T) := T に含まれる点について x 座標の最小値と最大値を それぞれ a , b , そして y 座標の最小値と最大値をそれぞれ c , d としたとき、 a ≤ x i ≤ b かつ c ≤ y i ≤ d を満たす 1 ≤ i ≤ N の個数
//
//S の空でない全ての部分集合 T についての f ( T) の和を計算してください。答えは非常に大きくなることがあるので、 998244353 で割った余りを出力してください。 
//
//制約
//1 ≤ N ≤ 2 × 10 5
//− 10 9 ≤ x i , y i ≤ 10 9
//x i ≠ x j ( i ≠ j)
//y i ≠ y j ( i ≠ j)
//入力は全て整数である
//
//入力
//入力は以下の形式で標準入力から与えられる。
//
//N
//x 1 y 1 
//:
//x N y N
//
//出力
//S の空でない全ての部分集合 T についての f ( T) の和を 998244353 で割った余りを出力せよ。 

        public const string SiteName    = "AtCoder";
        public const string ContestName = "past-sample";
        public const string ProblemName = "O";

        public const long Mod = 998244353L;

        public long[] pows;

        /// <summary>
        /// 2^powsN までの配列を用意する
        /// </summary>
        public void InitPows(int powsN, long mod = 1000000007L)
        {
            pows    = new long[powsN + 1];
            pows[0] = 1;
            for (int i = 1; i <= powsN; i++)
            {
                pows[i] =  pows[i - 1] * 2;
                pows[i] %= mod;
            }
        }

        public void Solve()
        {
            int N = cin.ReadInt;

            Point[] P = new Point[N];

            for (int i = 0; i < N; i++)
            {
                P[i] = new Point(cin.ReadInt, cin.ReadInt);
            }

            // yの昇順でソート
            Array.Sort(P, (a, b) => a.Y - b.Y);

            // yの座標を [0, N - 1] に圧縮
            for (int i = 0; i < N; i++)
            {
                P[i].Y = i;
            }

            // xの昇順でソート
            Array.Sort(P, (a, b) => a.X - b.X);

            long[] belows = new long[N];

            var st = new SegTree<int>(N, 0, (a, b) => a + b, 0);

            // belows[i] : x座標の昇順でi番目までの点について、その点よりy座標が小さい点の数
            for (int i = 0; i < N; i++)
            {
                belows[i] = st.Query(0, P[i].Y);
                st.Update(P[i].Y, 1);
            }

            // afterBelows[i] : x座標の昇順でi番目より後の点について、その点よりy座標が小さい点の数
            long[] afterBelows = new long[N];
            for (int i = 0; i < N; i++)
            {
                afterBelows[i] = st.Query(0, P[i].Y) - belows[i];
            }

            long res = 0;

            InitPows(N, Mod);

            for (int i = 0; i < N; i++)
            {
                res += CalcCount(belows[i], i - belows[i], N - i - 1 - afterBelows[i], afterBelows[i]);
                res %= Mod;
            }

            cou.WriteLine(res);
        }

        /// <summary>
        /// b|c
        /// ---
        /// a|d
        /// それぞれの領域にある点の数から、場合の数を計算して返す
        /// </summary>
        public long CalcCount(long a, long b, long c, long d)
        {
            long[] nums = {a, b, c, d};

            long[] ok  = new long[4]; // 領域に点が存在する場合の数
            long[] any = new long[4]; // 領域に点が存在する場合と存在しない場合の数の和

            for (int i = 0; i < 4; i++)
            {
                any[i] =  pows[nums[i]]; // 2^a
                any[i] %= Mod;
                ok[i]  =  any[i] - 1; // 2^a -1 
                ok[i]  %= Mod;
            }

            long res = 0;

            // o|x   x|o   o|o
            // --- + --- - ---
            // x|o   o|x   o|o

            res += any[0] * ok[1] % Mod * any[2] % Mod * ok[3] % Mod;
            res %= Mod;
            res += ok[0] * any[1] % Mod * ok[2] % Mod * any[3] % Mod;
            res %= Mod;
            res -= ok[0] * ok[1] % Mod * ok[2] % Mod * ok[3] % Mod;
            res %= Mod;

            // 自分自身を選んでいる場合
            //res += any[0] * any[1] % Mod * any[2] % Mod * any[3] % Mod;   //こうやっても同じこと
            res += pows[a + b + c + d]; // つまり pows[N -1] = 2^(N-1) 
            res %= Mod;

            return res;
        }
    }

    public sealed class Point : Pair<int, int>
    {
        public Point(int x, int y) : base(x, y)
        {
        }
    }

    [DebuggerDisplay("({X}, {Y})")]
    public class Pair<T1, T2> : IComparable<Pair<T1, T2>>, IEquatable<Pair<T1, T2>>
        where T1 : IComparable<T1>
        where T2 : IComparable<T2>
    {
        public Pair(T1 x, T2 y)
        {
            X = x;
            Y = y;
        }

        public T1 X;
        public T2 Y;

        public int CompareTo(Pair<T1, T2> other)
        {
            if (ReferenceEquals(this, other)) return 0;
            if (ReferenceEquals(null, other)) return 1;
            var firstComparison = X.CompareTo(other.X);
            return firstComparison != 0 ? firstComparison : Y.CompareTo(other.Y);
        }

        public override string ToString() => $"({X}, {Y})";

        public bool Equals(Pair<T1, T2> other)
        {
            if (ReferenceEquals(null, other)) return false;
            if (ReferenceEquals(this, other)) return true;
            return EqualityComparer<T1>.Default.Equals(X, other.X) &&
                   EqualityComparer<T2>.Default.Equals(Y, other.Y);
        }

        public override bool Equals(object obj)
        {
            if (ReferenceEquals(null, obj)) return false;
            if (ReferenceEquals(this, obj)) return true;
            return obj.GetType() == this.GetType() && Equals((Pair<T1, T2>)obj);
        }

        public override int GetHashCode()
        {
            unchecked
            {
                return (EqualityComparer<T1>.Default.GetHashCode(X) * 397) ^
                       EqualityComparer<T2>.Default.GetHashCode(Y);
            }
        }
    }

    /// <summary>
    /// 
    /// SegmentTree
    /// 一点更新区間取得
    /// 可換
    /// 
    /// Dataは0始まりになっている
    /// ノードiの子ノードの番号は 2 * i + 1 / 2 * i + 2
    /// ノードiの親ノードの番号は (i - 1) / 2
    /// 
    ///        0
    ///    1       2
    ///  3   4   5   6
    ///
    /// ExValueは不正値 MergeがMinならInfに相当する 大体単位元にしておけばよいが問題に合わせる
    /// 
    /// </summary>
    public class SegTree<T>
    {
        int           TotalLength;
        T[]           Data;
        Func<T, T, T> Merge;
        T             ExValue;

        public SegTree(
            int length,
            Func<T, T, T> merge,
            T exValue)
        {
            Merge       = merge;
            ExValue     = exValue;
            TotalLength = 1;

            while (TotalLength < length) TotalLength *= 2;

            Data = new T[2 * TotalLength - 1];

            for (int i = 0; i < Data.Length; i++) Data[i] = exValue;
        }

        public SegTree(
            int length,
            T initialValue,
            Func<T, T, T> integrate,
            T exValue)
            : this(length, integrate, exValue)
        {
            for (int i = 0; i < length; i++)
            {
                Data[i + TotalLength - 1] = initialValue;
            }

            UpdateAll();
        }

        /// <summary>
        /// ツリーの更新なしに i番目の葉の値を更新する
        /// </summary>
        public void AssignWithoutUpdate(int i, T value)
        {
            Data[i + TotalLength - 1] = value;
        }

        /// <summary>
        /// i番目の葉の値を更新し、ツリーを更新する
        /// </summary>
        public void Update(int i, T value)
        {
            int now = i + TotalLength - 1;
            Data[now] = value;

            while (now > 0)
            {
                now = (now - 1) / 2;

                Data[now] = Merge(Data[now * 2 + 1], Data[now * 2 + 2]);
            }
        }

        public void UpdateAll()
        {
            for (int i = TotalLength - 2; i >= 0; i--)
            {
                Data[i] = Merge(Data[i * 2 + 1], Data[i * 2 + 2]);
            }
        }

        /// <summary>
        /// i番目の葉の値を取得する
        /// </summary>
        public T Look(int i)
        {
            return Data[i + TotalLength - 1];
        }

        /// <summary>
        /// [a, b) の区間に対するクエリについて答える
        /// </summary>
        public T Query(int a, int b)
        {
            return QueryInternal(a, b, 0, 0, TotalLength);
        }

        /// <summary>
        /// [a, b) の区間に対するクエリについて
        /// ノード i (区間 [l, r) 担当) が答える
        /// </summary>
        private T QueryInternal(int a, int b, int i, int l, int r)
        {
            if (r <= a || b <= l) return ExValue;
            if (a <= l && r <= b) return Data[i];

            T leftValue = QueryInternal(a, b, i * 2 + 1,
                l, (l + r) / 2);
            T rightValue = QueryInternal(a, b, i * 2 + 2,
                (l + r) / 2, r);

            return Merge(leftValue, rightValue);
        }
    }


//=========================================================================================
// Debug IO
//=========================================================================================

    public partial class Program
    {
        //=========================================================================================
        // Main
        //=========================================================================================

        private readonly ConsoleInput cin;
        private readonly IConsole     cou;

        public Program(ConsoleInput cin, IConsole cou)
        {
            this.cin = cin;
            this.cou = cou;
        }

        public static void Main(string[] args)
        {
#if UTAKA_LOCAL
//#if false
            new TestCaseCheckerForAtCoder().TestProblems();
#else
            var cin = new ConsoleInput(System.Console.In);
            var console = new MyConsole();
            new Program(cin, console).Solve();
            console.Flush();
#endif
        }

        //=========================================================================================
        // Library
        //=========================================================================================

        public static T[] Array1D<T>(int a, T defaultValue)
            where T : struct
        {
            var ret = new T[a];
            for (int i = 0; i < a; i++)
            {
                ret[i] = defaultValue;
            }

            return ret;
        }

        public static T[] Array1D<T>(int a)
            where T : struct
        {
            var ret = new T[a];
            return ret;
        }

        /// <summary>
        /// 要素数 (a, b) の、defaultValue で満たされた配列を作成します。
        /// </summary>
        /// <typeparam name="T">配列の型</typeparam>
        /// <param name="a">1次元の要素数</param>
        /// <param name="b">2次元の要素数</param>
        /// <param name="defaultValue">デフォルト値</param>
        /// <returns>指定した条件で初期化された配列</returns>
        public static T[,] Array2D<T>(int a, int b, T defaultValue)
            where T : struct
        {
            var ret = new T[a, b];
            for (int i = 0; i < a; i++)
            {
                for (int j = 0; j < b; j++)
                {
                    ret[i, j] = defaultValue;
                }
            }

            return ret;
        }

        public static T[,,] Array3D<T>(int a, int b, int c, T defaultValue)
            where T : struct
        {
            T[,,] ret = new T[a, b, c];

            for (int i = 0; i < a; i++)
            {
                for (int j = 0; j < b; j++)
                {
                    for (int k = 0; k < c; k++)
                    {
                        ret[i, j, k] = defaultValue;
                    }
                }
            }

            return ret;
        }

        /// <summary>
        /// 要素数 (a, b) の、defaultValue で満たされたJag配列を作成します。
        /// </summary>
        /// <typeparam name="T">配列の型</typeparam>
        /// <param name="a">1次元の要素数</param>
        /// <param name="b">2次元の要素数</param>
        /// <param name="defaultValue">デフォルト値</param>
        /// <returns>指定した条件で初期化された配列</returns>
        public static T[][] JagArray2D<T>(int a, int b, T defaultValue)
            where T : struct
        {
            var ret = new T[a][];
            for (int i = 0; i < a; i++)
            {
                var row = new T[b];
                ret[i] = row;

                for (int j = 0; j < b; j++)
                {
                    row[j] = defaultValue;
                }
            }

            return ret;
        }

        /// <summary>
        /// 要素数 (a, b) のdefault値で満たされたJag配列を作成します。
        /// </summary>
        /// <typeparam name="T">配列の型</typeparam>
        /// <param name="a">1次元の要素数</param>
        /// <param name="b">2次元の要素数</param>
        /// <returns>初期化された配列</returns>
        public static T[][] JagArray2D<T>(int a, int b)
            where T : struct
        {
            var ret = new T[a][];
            for (int i = 0; i < a; i++)
            {
                ret[i] = new T[b];
            }

            return ret;
        }

        public static T[][][] JagArray3D<T>(int a, int b, int c, T defaultValue)
            where T : struct
        {
            var ret = new T[a][][];
            for (int i = 0; i < a; i++)
            {
                T[][] aRow = new T[b][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[] bRow = new T[c];
                    aRow[j] = bRow;

                    for (int k = 0; k < c; k++)
                    {
                        bRow[k] = defaultValue;
                    }
                }
            }

            return ret;
        }

        public static T[][][] JagArray3D<T>(int a, int b, int c)
            where T : struct
        {
            var ret = new T[a][][];
            for (int i = 0; i < a; i++)
            {
                T[][] aRow = new T[b][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[] bRow = new T[c];
                    aRow[j] = bRow;
                }
            }

            return ret;
        }

        public static T[][][][] JagArray4D<T>(int a, int b, int c, int d, T defaultValue)
            where T : struct
        {
            var ret = new T[a][][][];
            for (int i = 0; i < a; i++)
            {
                T[][][] aRow = new T[b][][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[][] bRow = new T[c][];
                    aRow[j] = bRow;

                    for (int k = 0; k < c; k++)
                    {
                        T[] cRow = new T[d];
                        bRow[k] = cRow;

                        for (int l = 0; l < d; l++)
                        {
                            cRow[l] = defaultValue;
                        }
                    }
                }
            }

            return ret;
        }

        public static T[][][][] JagArray4D<T>(int a, int b, int c, int d)
            where T : struct
        {
            var ret = new T[a][][][];
            for (int i = 0; i < a; i++)
            {
                T[][][] aRow = new T[b][][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[][] bRow = new T[c][];
                    aRow[j] = bRow;

                    for (int k = 0; k < c; k++)
                    {
                        T[] cRow = new T[d];
                        bRow[k] = cRow;
                    }
                }
            }

            return ret;
        }

        public static T[][][][][] JagArray5D<T>(int a, int b, int c, int d, int e, T defaultValue)
            where T : struct
        {
            var ret = new T[a][][][][];
            for (int i = 0; i < a; i++)
            {
                T[][][][] aRow = new T[b][][][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[][][] bRow = new T[c][][];
                    aRow[j] = bRow;

                    for (int k = 0; k < c; k++)
                    {
                        T[][] cRow = new T[d][];
                        bRow[k] = cRow;

                        for (int l = 0; l < d; l++)
                        {
                            T[] dRow = new T[e];
                            cRow[l] = dRow;

                            for (int m = 0; m < e; m++)
                            {
                                dRow[m] = defaultValue;
                            }
                        }
                    }
                }
            }

            return ret;
        }

        public static T[][][][][] JagArray5D<T>(int a, int b, int c, int d, int e)
            where T : struct
        {
            var ret = new T[a][][][][];
            for (int i = 0; i < a; i++)
            {
                T[][][][] aRow = new T[b][][][];
                ret[i] = aRow;

                for (int j = 0; j < b; j++)
                {
                    T[][][] bRow = new T[c][][];
                    aRow[j] = bRow;

                    for (int k = 0; k < c; k++)
                    {
                        T[][] cRow = new T[d][];
                        bRow[k] = cRow;

                        for (int l = 0; l < d; l++)
                        {
                            T[] dRow = new T[e];
                            cRow[l] = dRow;
                        }
                    }
                }
            }

            return ret;
        }

        /// <summary>
        /// ジャグ配列をコピーして返す。
        /// </summary>
        public static T[][] CopyJagArray2D<T>(T[][] source)
            where T : struct
        {
            int   len  = source.Length;
            T[][] dest = new T[len][];

            for (int i = 0; i < len; i++)
            {
                T[] inner       = source[i];
                int innerLength = inner.Length;
                T[] newer       = new T[innerLength];
                Array.Copy(inner, newer, innerLength);
                dest[i] = newer;
            }

            return dest;
        }
    }

    public static class UtakaExtentions
    {
        /// <summary>
        /// 配列をコピーします
        /// </summary>
        public static T[] Copy<T>(this IList<T> a)
        {
            T[] ret = new T[a.Count];

            for (int i = 0; i < a.Count; i++) ret[i] = a[i];

            return ret;
        }
    }

    public class ConsoleInput
    {
        private readonly char          _separator = ' ';
        private readonly TextReader    _stream;
        private readonly Queue<string> inputStream;

        public ConsoleInput(TextReader stream, char separator = ' ')
        {
            _separator  = separator;
            _stream     = stream;
            inputStream = new Queue<string>();
        }

        public string Read
        {
            get
            {
                if (inputStream.Count != 0)
                {
                    return inputStream.Dequeue();
                }

                var tmp = _stream.ReadLine().Split(_separator);
                for (var i = 0; i < tmp.Length; ++i)
                {
                    inputStream.Enqueue(tmp[i]);
                }

                return inputStream.Dequeue();
            }
        }

        public string ReadLine   => _stream.ReadLine();
        public int    ReadInt    => int.Parse(Read);
        public long   ReadLong   => long.Parse(Read);
        public double ReadDouble => double.Parse(Read);

        public string[] ReadStrArray(long N)
        {
            var ret = new string[N];
            for (long i = 0; i < N; ++i)
            {
                ret[i] = Read;
            }

            return ret;
        }

        public int[] ReadIntArray(long N)
        {
            var ret = new int[N];
            for (long i = 0; i < N; ++i)
            {
                ret[i] = ReadInt;
            }

            return ret;
        }

        public long[] ReadLongArray(long N)
        {
            var ret = new long[N];
            for (long i = 0; i < N; ++i)
            {
                ret[i] = ReadLong;
            }

            return ret;
        }
    }

    public interface IConsole
    {
        void Flush();
        void Write(object obj);
        void Write(string str);
        void WriteLine(object obj);
        void WriteLine(string str);
        void WriteLine();
    }

    public class MyConsole : IConsole
    {
        public MyConsole()
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false};
            Console.SetOut(sw);
        }

        public void Flush()
        {
            Console.Out.Flush();
        }

        public void Write(object obj)
        {
            Write(obj.ToString());
        }

        public void Write(string str)
        {
            Console.Write(str);
        }

        public void WriteLine(object obj)
        {
            WriteLine(obj.ToString());
        }

        public void WriteLine(string str)
        {
            Console.WriteLine(str);
        }

        public void WriteLine()
        {
            Console.WriteLine();
        }
    }

#if UTAKA_LOCAL

    public class DebugConsole : IConsole
    {
        private readonly StringBuilder mSb;

        public DebugConsole()
        {
            mSb = new StringBuilder();
        }

        public void Flush()
        {
            // 何もしない
        }

        public void Write(object obj)
        {
            Write(obj.ToString());
        }

        public void Write(string str)
        {
            mSb.Append(str);
        }

        public void WriteLine(object obj)
        {
            WriteLine(obj.ToString());
        }

        public void WriteLine(string str)
        {
            mSb.AppendLine(str);
        }

        public void WriteLine()
        {
            mSb.AppendLine();
        }

        public string GetAllOutput()
        {
            return mSb.ToString();
        }
    }

#endif

#if UTAKA_LOCAL

    public class TestCaseCheckerForAtCoder
    {
        private string GetDirectoryPath()
        {
            var problemPart = string.IsNullOrEmpty(Program.ProblemName)
                ? ""
                : $"/{Program.ProblemName}";

            return
                $"{Environment.GetFolderPath(Environment.SpecialFolder.UserProfile)}/AlgorithmPrac/{Program.SiteName}/{Program.ContestName}{problemPart}";
        }

        private string GetInputFilePath(int testCaseNumber)
        {
            return $"{GetDirectoryPath()}/sample-{testCaseNumber}.in";
        }

        private string GetOutputFilePath(int testCaseNumber)
        {
            return $"{GetDirectoryPath()}/sample-{testCaseNumber}.out";
        }

        public bool TestProblem(int testCaseNumber)
        {
            var inputFilePath  = GetInputFilePath(testCaseNumber);
            var outputFilePath = GetOutputFilePath(testCaseNumber);

            TextReader inputStream = new StreamReader(inputFilePath);
            var        cin         = new ConsoleInput(inputStream);

            var debugConsoleWriter = new DebugConsole();

            new Program(cin, debugConsoleWriter).Solve();

            var output = debugConsoleWriter.GetAllOutput();

            TextReader outputStream = new StreamReader(outputFilePath);
            var        outputAnswer = outputStream.ReadToEnd();

            Dbg.WriteLine(output);
            Dbg.WriteLine(outputAnswer);

            var isCorrect = output == outputAnswer;

            return isCorrect;
        }

        public void TestProblems(int targetTestCaseNumber = -1)
        {
            if (targetTestCaseNumber >= 0)
            {
                Console.WriteLine($"!!!!!!!!!!!! Check TestCase {targetTestCaseNumber} !!!!!!!!!!");
            }

            bool isSuccessAll = true;

            int testCaseNumber = 0;
            while (true)
            {
                testCaseNumber++;

                bool foundTargetTest = targetTestCaseNumber == testCaseNumber;

                if (targetTestCaseNumber >= 0 && !foundTargetTest)
                {
                    continue;
                }

                var inputFileName = GetInputFilePath(testCaseNumber);
                if (!File.Exists(inputFileName))
                {
                    break;
                }

                Console.WriteLine($"TestCase {testCaseNumber} =====================================================");

                var result = TestProblem(testCaseNumber);

                if (result)
                {
                    Console.WriteLine("Success");
                }
                else
                {
                    isSuccessAll = false;
                    Console.WriteLine("Failure *****");
                }

                if (foundTargetTest)
                {
                    break;
                }
            }

            if (isSuccessAll)
            {
                Console.WriteLine("!!!!!!!!! All Success !!!!!!!!!");
            }
        }
    }

#endif

    public static class Dbg
    {
        [Conditional("UTAKA_DEBUG")]
        public static void WriteLine(string str)
        {
            Console.WriteLine(str);
        }

        [Conditional("UTAKA_DEBUG")]
        public static void WriteLine()
        {
            Console.WriteLine();
        }

        [Conditional("UTAKA_DEBUG")]
        public static void Write(string str)
        {
            Console.Write(str);
        }
    }
}


Measured memory_bytes: 30232