#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll q;
    cin >> q;

    ll c = 0, n1 = 0, n2 = 0, s1 = 0, s2 = 0;
    priority_queue<ll> que1;
    priority_queue<ll, vector<ll>, greater<ll>> que2;
    while(q--) {
        ll type;
        cin >> type;
        if(type == 1) {
            ll a, b;
            cin >> a >> b;
            c += b;
            // que1を増やす
            if(n1 == n2) {
                if(que2.empty() || a < que2.top()) {
                    que1.push(a);
                    n1++;
                    s1 += a;
                } else {
                    que1.push(que2.top());
                    n1++;
                    s1 += que2.top();
                    s2 += a - que2.top();
                    que2.pop();
                    que2.push(a);
                }
            }
            // que2を増やす
            else {
                if(a > que1.top()) {
                    que2.push(a);
                    n2++;
                    s2 += a;
                } else {
                    que2.push(que1.top());
                    n2++;
                    s2 += que1.top();
                    s1 += a - que1.top();
                    que1.pop();
                    que1.push(a);
                }
            }
        } else {
            ll idx = que1.top();
            ll ans = idx*n1 - s1 + s2 - idx*n2 + c;
            // cout << n1 << " " << s1 << " " << n2 << " " << s2 << " " << c << endl;
            cout << idx << " " << ans << endl;
        }

        // auto v1(que1);
        // auto v2(que2);
        // cout << "v1=";
        // while(v1.size()) { cout << v1.top() << " "; v1.pop(); }
        // cout << endl;
        // cout << "s1=" << s1 << endl;
        // cout << "v2=";
        // while(v2.size()) { cout << v2.top() << " "; v2.pop(); }
        // cout << endl;
        // cout << "s2=" << s2 << endl;
        // cout << endl;
    }

    return 0;
}


Measured memory_bytes: 3828