#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

/* 0-indexed BIT */
struct BIT{
    using T = long long;
    int n;
    vector<T> bit;
    BIT(){}
    BIT(int n_){
        n = n_;
        bit.assign(n,0);
    }
    // sum of data[0] + ... + data[i-1]
    T sum(int a){
        T ret=0;
        for(int x=a-1;x>=0;x=(x&(x+1))-1){
            ret+=bit[x];
        }
        return ret;
    }
    void add(int a,int w){
        for(int x=a;x<n;x|=x+1){
            bit[x]+= w;
        }
    }

    // sum(i) >= xとなる最小のiを返す
    // sum(all) < xの場合はnを返す
    int lower_bound(T x){
        int l=0;
        int r=n;
        while(r-l>1){
            const int m=(l+r)/2;
            if(sum(m)>=x) r=m;
            else l=m;
        }
        return r;
    }
};

struct Query{
    int i;
    ll a,b;
};

int main(){
    int Q; cin >> Q;
    vector<Query> qs(Q);
    set<ll> st;
    for(int i=0;i<Q;i++){
        cin >> qs[i].i;
        if(qs[i].i == 1){
            cin >> qs[i].a >> qs[i].b;
            st.insert(qs[i].a);
        }
    }
    vector<ll> pd(st.size());
    int idx=0;
    for(auto&& v : st){
        pd[idx++] = v;
    }
    //debug(pd);


    BIT bit(pd.size());
    BIT sum(pd.size());
    ll bs = 0;
    int n=0;
    rep(i,Q){
        if(qs[i].i == 1){
            bs += qs[i].b;
            int idx = lower_bound(pd.begin(),pd.end(),qs[i].a) - pd.begin();
            assert(idx>=0);
            bit.add(idx,1);
            sum.add(idx,pd[idx]);
            n++;
        }else if(qs[i].i==2){
            const int idx = bit.lower_bound((n+1)/2)-1;
            assert(idx>=0);
            const ll value = pd[idx];
            ll left = sum.sum(idx+1);
            ll lc = bit.sum(idx+1);
            ll right = sum.sum(pd.size()) - left;
            ll rc = bit.sum(pd.size()) - lc;    // RE
            cout << value << " " << lc * value - left + right - rc * value + bs << endl;
        }
    }
}


Measured memory_bytes: 14336