#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 20000;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll q;
    cin >> q;
    ll c = 0,lc = 0,rc = 0,x,res = 0;
    priority_queue<ll> l;
    priority_queue<ll,vector<ll>,greater<ll>> r;
    rep(i,q){
        ll f,a,b;
        cin >> f;
        if (lc == 0){
            cin >> a >> b;
            c += b;
            l.push(a);
            x = a;
            lc++;
            continue;
        }
        else if (rc == 0){
            if (f == 1){
                cin >> a >> b;
                c += b;
                rc++;
                if (l.top() <= a){
                    r.push(a);
                    res += abs(x-a);
                }
                else{
                    r.push(l.top());
                    l.pop();
                    l.push(a);
                    res += abs(x-a);
                    x = a;
                }
            }
            else{
                cout << x << " " << res+c << '\n';
            }
        }
        else if (f == 1){
            cin >> a >> b;
            c += b;
            if ((lc+rc)%2 == 0){
                lc++;
                if (r.top() <= a){
                    l.push(r.top());
                    r.pop();
                    r.push(a);
                }
                else l.push(a);
                res += abs(l.top()-a);
                x = l.top();
            }
            else{
                rc++;
                if (l.top() >= a){
                    r.push(l.top());
                    l.pop();
                    l.push(a);
                }
                else r.push(a);
                res += abs(l.top()-a)+abs(l.top()-x);
                x = l.top();
            }
        }
        else cout << x << " " << res+c << '\n';
    }
}

Measured memory_bytes: 3828