#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii=pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c),end(c)
#define rall(c) rbegin(c),rend(c)
#define fore(x,c) for(auto &&x:c)
#define rep(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define rrep(i, a, n) for(int i=(int)(n-1);i>=a;--i)
#define sz(c) ((int)c.size())
#define contains(c,x) (c.find(x)!=end(c))
#define inseg(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(nullptr); ios::sync_with_stdio(0);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

int Signum(int a, int b) {
    if(a == b) return 0;
    return a < b ? -1 : 1;
}
int suml, sumr;
int getMedian(int e, int &m, priority_queue<int> &l, heap<int> &r) {
    switch(Signum(l.size(), r.size())) {
    case 1:
        if (e <= m) {
            r.push(l.top());
            sumr += l.top();
            suml -= l.top();
            l.pop();
            l.push(e);
            suml += e;
        } else {
            r.push(e); 
            sumr += e;
        } 
        m = l.top(); 
        break; 
    case 0:
        if (e <= m) { 
            l.push(e); 
            suml += e;
            m = l.top(); 
        } else { 
            r.push(e); 
            sumr += e;
            m = r.top(); 
        }
        break; 
    case -1:
        if (e <= m) {
            l.push(e); 
            suml += e;
        } else {
            l.push(r.top());
            suml += r.top();
            sumr -= r.top();
            r.pop(); 
            r.push(e); 
            sumr += e;
        }
        m = l.top();
        break; 
    }
    return m; 
} 
signed main() {
    int Q;
    cin >> Q;
    priority_queue<int> l;
    heap<int> r;
    int median = 0;
    int sumb = 0;
    suml = 0, sumr = 0;
    while (Q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int a, b;
            cin >> a >> b;
            getMedian(a, median, l, r);
            sumb += b;
        } else {
            int mn = sumr - sz(r) * median + sz(l) * median - suml;
            cout << median << " " << mn + sumb << endl;
        }
    }
    return (0^_^0);
}



Measured memory_bytes: 3828