// May this submission get accepted!

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(i, (q).size()) { cerr << (q)[i] << (i == i_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
#define CHOKUDAI_ const
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using cll = DANCE_ DANCE_ CHOKUDAI_;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ll q; cin >> q;
    ll co = 0;
    priority_queue<ll> ql;
    priority_queue<ll, vector<ll>, greater<ll>> qr;
    ll qlsum = 0, qrsum = 0;

    REP(t, q) {

        ll query; cin >> query;
        if (query == 2) {

            // DUMP(qlsum);
            // DUMP(qrsum);
            // DUMP(ql.size());
            // DUMP(qr.size());
            // DUMP(co);
            
            ll x = ql.size() == qr.size() ? ql.top() : qr.top();
            ll xlraw = x * (ll)ql.size() - qlsum;
            ll xrraw = x * (ll)qr.size() - qrsum;
            ll y = xlraw - xrraw + co;
            cout << x << " " << y << endl;

        } else {

            ll a, b; cin >> a >> b;
            co += b;

            if (ql.size() == qr.size()) {
                if (!ql.empty() && ql.top() >= a) {
                    ll tmp = ql.top();
                    ql.pop();     qlsum -= tmp;
                    qr.push(tmp); qrsum += tmp;
                    ql.push(a);   qlsum += a;
                } else {
                    qr.push(a);   qrsum += a;
                }
            } else {
                if (!qr.empty() && qr.top() <= a) {
                    ll tmp = qr.top();
                    qr.pop();     qrsum -= tmp;
                    ql.push(tmp); qlsum += tmp;
                    qr.push(a);   qrsum += a;
                } else {
                    ql.push(a);   qlsum += a;
                }
            }

        }

    }
    
}

Measured memory_bytes: 3828