#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
#define F first
#define S second
const ll E=1e18+7;
const ll 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)>;
    int n,height;
    F f;
    G g;
    H h;
    T ti;
    E ei;
    vector<T> dat;
    vector<E> laz;
    SegmentTree(F f,G g,H h,T ti,E ei):
    f(f),g(g),h(h),ti(ti),ei(ei){}
    
    void init(int n_){
        n=1;height=0;
        while(n<n_) n<<=1,height++;
        dat.assign(2*n,ti);
        laz.assign(2*n,ei);
    }
    void build(const vector<T> &v){
        int n_=v.size();
        init(n_);
        for(int i=0;i<n_;i++) dat[n+i]=v[i];
        for(int i=n-1;i;i--)
            dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
    }
    inline T reflect(int k){
        return laz[k]==ei?dat[k]:g(dat[k],laz[k]);
    }
    inline void eval(int k){
        if(laz[k]==ei) return;
        laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);
        laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);
        dat[k]=reflect(k);
        laz[k]=ei;
    }
    inline void thrust(int k){
        for(int i=height;i;i--) eval(k>>i);
    }
    inline void recalc(int k){
        while(k>>=1)
            dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));
    }
    void update(int a,int b,E x){
        thrust(a+=n);
        thrust(b+=n-1);
        for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
            if(l&1) laz[l]=h(laz[l],x),l++;
            if(r&1) --r,laz[r]=h(laz[r],x);
        }
        recalc(a);
        recalc(b);
    }
    void set_val(int a,T x){
        thrust(a+=n);
        dat[a]=x;laz[a]=ei;
        recalc(a);
    }
    T query(int a,int b){
        thrust(a+=n);
        thrust(b+=n-1);
        T vl=ti,vr=ti;
        for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {
            if(l&1) vl=f(vl,reflect(l++));
            if(r&1) vr=f(reflect(--r),vr);
        }
        return f(vl,vr);
    }
};

int main(){
    ll q;
    cin>>q;
    multiset<ll> S;
    ll sum=0;
    ll idxL=0,idxR=0;
    ll cnt=0;
    ll cntl=0;
    auto I=S.begin();
    while(q--){
        int com;
        cin>>com;
        if(com==1){
            cnt++;
            ll a,b;
            cin>>a>>b;
            sum+=b;
            if(S.empty()){S.insert(a); I=S.begin(); cntl++; idxL+=a; continue;}
            if(*I>a){
                cntl++;
                S.insert(a);
                idxL+=a;
                while(((cnt&1) && (cntl-1)*2>cnt-1) || (cnt%2==0 && cntl*2>cnt)){
                    cntl--;
                    idxR+=*I;
                    idxL-=*I;
                    I--;
                }
            }
            else{
                idxR+=a;
                S.insert(a);
                while(((cnt&1) && (cntl-1)*2<cnt-1) || (cnt%2==0 && cntl*2<cnt)){
                    cntl++;
                    I++;
                    idxR-=*I;
                    idxL+=*I;
                }
            }
        }
        else{
            ll W=*I;
            //cout<<sum<<" "<<cntl<<" "<<idxL<<" "<<idxR<<endl;
            cout<<W<<" "<<sum+(cntl*W-idxL)+(idxR-W*(cnt-cntl))<<endl;
        }
    }
    
    
    return 0;
}


Measured memory_bytes: 9600