#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
template<typename T, typename E>
struct SegmentTree {
    using F = function<T(T, T)>;
    using G = function<T(T, E)>;
    using H = function<E(E, E)>;
    using P = function<E(E, size_t)>;
    int n;
    F f; //要素と要素のマージ
    G g; //要素に作用素を作用
    H h; //作用素と作用素をマージ
    T ti; //要素の単位元?
    E ei; //作用素の単位元?
    P p; //b個の作用素aをマージした場合
    vector<T> dat;
    vector<E> laz;

    SegmentTree(int n_, F f, G g, H h, T ti, E ei,
                P p = [](E a, size_t b) {
                    b++;
                    return a;
                }) :
            f(f), g(g), h(h), ti(ti), ei(ei), p(p) {
        init(n_);
    }

    void init(int n_) {
        n = 1;
        while (n < n_) n *= 2;
        dat.assign(2 * n - 1, ti);
        laz.assign(2 * n - 1, ei);
    }

    void build(int n_, vector<T> v) {
        for (int i = 0; i < n_; i++) dat[i + n - 1] = v[i];
        for (int i = n - 2; i >= 0; i--)
            dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
    }

    inline void eval(int len, int k) {
        if (laz[k] == ei) return;
        if (k * 2 + 1 < n * 2 - 1) {
            laz[k * 2 + 1] = h(laz[k * 2 + 1], laz[k]);
            laz[k * 2 + 2] = h(laz[k * 2 + 2], laz[k]);
        }
        dat[k] = g(dat[k], p(laz[k], len));
        laz[k] = ei;
    }

    T update(int a, int b, E x, int k, int l, int r) {
        eval(r - l, k);
        if (r <= a || b <= l) return dat[k];
        if (a <= l && r <= b) {
            laz[k] = h(laz[k], x);
            return g(dat[k], p(laz[k], r - l));
        }
        return dat[k] = f(update(a, b, x, k * 2 + 1, l, (l + r) / 2),
                          update(a, b, x, k * 2 + 2, (l + r) / 2, r));
    }

    T update(int a, int b, E x) {
        return update(a, b, x, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r) {
        eval(r - l, k);
        if (r <= a || b <= l) return ti;
        if (a <= l && r <= b) return dat[k];
        T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
        T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
        return f(vl, vr);
    }

    T query(int a, int b) {
        return query(a, b, 0, 0, n);
    }

    /**
     * kをxに更新する
     */
    void update(int k, T x) {
//        query(k, k + 1);//evaluate
//        k += n - 1;
//        dat[k] = x;
//        while (k) {
//            k = (k - 1) / 2;
//            dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
//        }
        update(k, k + 1, x);
    }
};

class Solve {
public:
    int Q;
    struct query {
        int n;
        ll a;
        ll b;
    };
    vector<query> queries;
    map<ll, int> zatsu;
    vector<ll> inv;

    void input() {
        cin >> Q;
        rep(i, 0, Q) {
            int n;
            cin >> n;
            if (n == 2) {
                queries.push_back(query({2}));
            } else {
                int a, b;
                cin >> a >> b;
                queries.push_back(query({1, a, b}));
            }
        }
        vector<ll> app;
        for (auto e : queries) {
            if (e.n == 1) {
                app.push_back(e.a);
//                app.push_back(e.b);
            }
        }
        sort(all(app));
        app.erase(unique(all(app)), app.end());
        inv = app;
        for (int i = 0; i < inv.size(); ++i) {
            zatsu[app[i]] = i;
        }
    }

    auto maketree() {
        int n = zatsu.size() + 1;
        using T = ll;
        using E = ll;
        auto f = [](T a, T b) { return a + b; }; // 要素と要素のマージ
        auto g = [](T a, E b) { return a + b; }; // 要素に作用素を作用
        auto h = [](E a, E b) { return a + b; }; // 作用素と作用素をマージ
        auto p = [](E a, int b) { return a * b; }; // 作用素を区間加算する場合
        T ti = 0; //要素の単位元?
        E ei = 0; //作用素の単位元?
        SegmentTree<T, E> treeone(n, f, g, h, ti, ei, p);
        return treeone;
    }


    void solve() {
        input();
        auto tree1 = maketree(); // cnt
        auto tree2 = maketree(); // sum
        int maxn = zatsu.size() + 1;
        int sz = 0;
        ll val = 0;
        for (auto q : queries) {
            if (q.n == 1) {
                val += q.b;
//                cerr << zatsu[q.a] << endl;
//                tree1.update(zatsu[q.a], maxn, 1);
                tree1.update(zatsu[q.a], 1);
                tree2.update(zatsu[q.a], q.a);
                sz++;
            } else {
                int ng = -1;
                int ok = maxn - 1;
                int tar = sz / 2;
                if (sz % 2 == 1) tar += 1;

                while (ok - ng > 1) {
                    int mid = (ok + ng) / 2;
                    int cnt = tree1.query(0, mid + 1);
                    if (cnt < tar) {
                        ng = mid;
                    } else {
                        ok = mid;
                    }
                }

                ll key = inv[ok];
                ll sum = -tree2.query(0, ok) + tree2.query(ok + 1, maxn);
                ll sub = (-tree1.query(ok + 1, maxn) + tree1.query(0, ok)) * key;
                ll ans = sum + sub + val;

//                ll sum = tree2.query(0, maxn);
//                ll sub = tree2.query(0, ok) + tree2.query(0, ok + 1);
//                ll sub2 = key * abs(tree1.query(ok + 1, maxn) - tree1.query(0, ok));
////                ll sub2 = key * (sz % 2);
////                ll sub3 = key * tree1.query(ok, ok + 1);
////                cerr << tree1.query(ok + 1, maxn) << "  " << tree1.query(0, ok) << endl;
//                ll value = sum - sub - sub2;
//                ll ans = value + val;
                cout << key << " " << ans << endl;
            }
        }


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 23660