using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

partial class Solver
{
    class Query
    {
        public int Index;
        public int Type;
        public int A, B;
    }

    struct Data
    {
        public int Index, Value;
    }

    public void Run()
    {
        var Q = ni();

        var queries = new List<Query>();
        var dataA = new List<Data>();
        long currentBSum = 0;
        for (int _ = 0; _ < Q; _++)
        {
            var t = ni();
            if (t == 1)
            {
                var a = ni();
                var b = ni();
                currentBSum += b;
                queries.Add(new Query { Index = _, Type = t, A = a, B = b });
                dataA.Add(new Data { Index = _, Value = a });
            }
            else if (t == 2)
            {
                queries.Add(new Query { Index = _, Type = t });
            }
        }
        dataA.Sort((d1, d2) => d1.Value.CompareTo(d2.Value));
        var positionFromQueryIndex = dataA
            .Select((d, i) => new { Index = i, QueryIndex = d.Index })
            .ToDictionary(g => g.QueryIndex, g => g.Index);

        var ans = new List<string>();

        queries.Reverse();

        var bit = new BinaryIndexTree(dataA.Count + 2);
        var flg = new BinaryIndexTree(dataA.Count + 2);
        for (int i = 0; i < dataA.Count; i++)
        {
            bit.Add(i, dataA[i].Value);
            flg.Add(i, 1);
        }

        int elements = dataA.Count;

        foreach (var q in queries)
        {
            if (q.Type == 1)
            {
                var pos = positionFromQueryIndex[q.Index];
                var current = bit.Sum(pos, pos);
                if (current != q.A) throw new Exception();
                bit.Add(pos, -current);
                flg.Add(pos, -flg.Sum(pos, pos));

                currentBSum -= q.B;

                elements--;
            }
            else
            {
                var medianIndex = (elements - 1) / 2;

                int pos = flg.LowerBound(medianIndex + 1);

                //cout.WriteLine("! " + pos + " " + medianIndex);

                long x = dataA[pos].Value;
                var leftSum = bit.Sum(0, pos - 1);
                var leftNum = medianIndex;
                long f = currentBSum;
                if (leftNum > 0)
                {
                    f += leftNum * x - leftSum;
                }

                var rightSum = bit.Sum(pos + 1, dataA.Count);
                var rightNum = Math.Max(0, elements - 1 - leftNum);

                if (rightNum > 0)
                {
                    f += rightSum - rightNum * x;
                }

                ans.Add(string.Format("{0} {1}", x, f));
            }
        }
        ans.Reverse();
        foreach (var s in ans)
        {
            cout.WriteLine(s);
        }
    }
}

public class BinaryIndexTree
{
    private long[] array;
    public BinaryIndexTree(int size)
    {
        array = new long[size];
    }
    public long Sum(long a, long b)
    { // [a,b]
        if (a != 0) return Sum(0, b) - Sum(0, a - 1);
        long val = 0;
        for (; b >= 0; b = (b & (b + 1)) - 1) val += array[b];
        return val;
    }

    public void Add(int k, long val)
    {
        for (; k < array.Length; k |= k + 1)
            array[k] += val;
    }

    public int LowerBound(long w)
    {
        if (w <= 0) return 0;
        int x = 0, k = 1, N = array.Length;
        while ((k << 1) <= N) k <<= 1;
        for (; k > 0; k >>= 1)
        {
            if (x + k - 1 < N && array[x + k - 1] < w)
            {
                w -= array[x + k - 1];
                x += k;
            }
        }
        return (x == N) ? -1 : x;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}


Measured memory_bytes: 43620