#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T,vector<T>,greater<T>>

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }


const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


ll solve(int N, vi& a) {
    return -1LL;
}

int main() {
    int Q; cin >> Q;
    ll base = 0;
    priority_queue<int> left;
    priority_queue<int, vi, greater<int>> right;
    int mid = INT_MIN, k = 0;
    ll lsum = 0, rsum = 0;
    rep(q,Q){
        int o; cin >> o;
        if (o == 1) {
            int a,b; cin >> a >> b;
            base += b;
            ++k;
            if (k == 1) {
                mid = a;
            } else {
                if (k % 2) {
                    if (a < mid) {
                        left.push(a);
                        lsum += a;
                    } else if (a == mid) {
                        left.push(a);
                        lsum += a;
                    } else {
                        left.push(mid);
                        lsum += mid;
                        right.push(a);
                        rsum += a;
                        assert(!right.empty());
                        mid = right.top();
                        right.pop();
                        rsum -= mid;
                    }
                } else {
                    if (mid < a) {
                        right.push(a);
                        rsum += a;
                    } else if (mid == a) {
                        right.push(a);
                        rsum += a;
                    } else {
                        right.push(mid);
                        rsum += mid;
                        left.push(a);
                        lsum += a;
                        assert(!left.empty());
                        mid = left.top();
                        left.pop();
                        lsum -= mid;
                    }
                }
            }
        } else {
            ll lcnt = (k-1)/2, rcnt = (k-1) - lcnt;
            ll sum = base + (lcnt*mid - lsum) + (rsum - rcnt*mid);
            printf("%d %lld\n", mid, sum);
        }
    }
    vi a;
    int N = loadvec(a);
    solve(N,a);
    return 0;
}


Measured memory_bytes: 3452