/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[100][100];

void cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから-----------
int main(void){
    ll q;
    cin >> q;
    multiset<ll> st1, st2;
    ll sum1 = 0;
    ll sum2 = 0;
    ll bsum = 0;
    st1.insert(INF);
    st2.insert(-INF);
    rep(ii, q){
        ll num;
        cin >> num;
        if(num == 1){
            ll a, b;
            cin >> a >> b;
            bsum += b;
            if(st1.size() > st2.size()){
                st2.insert(a);
                sum2 += a;
                auto itr = st2.end();
                itr--;
                st1.insert(*itr);
                //cout << *itr << endl;
                sum2 -= *itr;
                sum1 += *itr;
                st2.erase(itr);


                st2.insert(*st1.begin());
                sum1 -= *st1.begin();
                sum2 += *st1.begin();
                //cout << *st1.begin() << endl;

                st1.erase(st1.begin());

                //cout << sum1 << " " << sum2 << endl;
         
            } else {
                st1.insert(a);
                sum1 += a;
                st2.insert(*st1.begin());
                sum1 -= *st1.begin();
                sum2 += *st1.begin();
                st1.erase(st1.begin());

                auto itr = st2.end();
                itr--;
                st1.insert(*itr);
                sum2 -= *itr;
                sum1 += *itr;
                st2.erase(itr);
            }
        } else {
            ll x;
            auto itr = st2.end();
            itr--;
            if(st1.size() == st2.size()){
                x = *itr;
            } else {
                x = *st1.begin();
            }
            //cout << sum1 << " " << sum2 << " " << bsum << endl;
            cout << x << " ";
            cout << (sum1 - (ll)(st1.size() - 1) * x) + ((ll)(st2.size() - 1) * x - sum2) + bsum << endl;
        }
    }
}



Measured memory_bytes: 12908