using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int Q = cin.nextint;

        var M = new LongMedianQueue();

        var K = cin.nextlong;
        M.Enqueue(cin.nextlong);
        K = cin.nextlong;

        for (int i = 0; i < Q - 1; i++)
        {
            if (cin.nextint == 2)
            {
                var ret = M.Med * M.left.Count - M.left.Sum;
                ret += M.right.Sum - M.Med * M.right.Count;
                WriteLine($"{M.Med} {ret + K}");
                continue;
            }

            M.Enqueue(cin.nextlong);
            K += cin.nextlong;
        }
    }

}

class LongMedianQueue
{
    public bool even;
    public LongPriorityQueue left, right;
    public LongMedianQueue()
    {
        left = new LongPriorityQueue();
        right = new LongPriorityQueue(-1);
        even = true;
    }
    public void Enqueue(long x)
    {
        even = !even;
        if (!Any || x.CompareTo(Med) < 0)
        {
            left.Enqueue(x);
            if (even) right.Enqueue(left.Dequeue());
        }
        else
        {
            right.Enqueue(x);
            if (!even) left.Enqueue(right.Dequeue());
        }
    }
    public long Dequeue(long x)
    {
        even = !even;
        var ret = left.Dequeue();
        if (!even) left.Enqueue(right.Dequeue());
        return ret;
    }
    public int Count => left.Count + right.Count;
    public bool Any => left.Count > 0;
    public long Med => left.Peek();
}

class LongPriorityQueue
{
    List<long> heap;
    readonly int cmp;
    public LongPriorityQueue(int cmp = 1) { heap = new List<long>(); this.cmp = cmp; }
    public void Enqueue(long x)
    {
        Sum += x;
        heap.Add(x);
        int i = Count++;
        while (i > 0)
        {
            int p = (i - 1) >> 1;
            if (x.CompareTo(heap[p]) * cmp <= 0) break;
            heap[i] = heap[p]; i = p;
        }
        heap[i] = x;
    }
    public long Dequeue()
    {
        var ret = heap[0]; var x = heap[--Count];
        Sum -= ret;
        int i = 0;
        while ((i << 1) + 1 < Count)
        {
            int a = (i << 1) + 1; int b = (i << 1) + 2;
            if (b < Count && heap[a].CompareTo(heap[b]) * cmp < 0) a = b;
            if (x.CompareTo(heap[a]) * cmp >= 0) break;
            heap[i] = heap[a]; i = a;
        }
        heap[i] = x; heap.RemoveAt(Count);
        return ret;
    }
    public long Sum { get; private set; }
    public int Count { get; private set; }
    public bool Any => Count > 0;
    public long Peek() => heap[0];
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 21284