# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
 
struct BIT {
	vector<LL> bit;
	BIT(LL n) {
		bit.resize(n + 10);
	}
 
	//[0, i)
	LL sum(int i) {
		LL s = 0;
		for (int x = i - 1; x >= 0; x = (x&(x + 1)) - 1) {
			s += bit[x];
		}
		return s;
	}
 
    //[l, r)
    LL sum(int l, int r){
        return sum(r) - sum(l);
    }
 
    //[0, i]
    LL sum_open(int i) {
		LL s = 0;
		for (int x = i; x >= 0; x = (x&(x + 1)) - 1) {
			s += bit[x];
		}
		return s;
	}
 
    //[l, r]
    LL sum_open(int l, int r){
        return sum_open(r) - sum_open(l - 1);
    }
	void add(int a, LL w) {
		for (int x = a; x < (int)bit.size(); x |= x + 1) {
			bit[x] += w;
		}
	}
 
    //indexを返す
    int lower_bound(LL x){
        int l = -1, r = (int)bit.size();
        while(r - l > 1){
            int mid = (l + r)/2;
            if(sum_open(mid) < x){
                l = mid;
            }else{
                r = mid;
            }
        }
        return r;
    }
 
    //indexを返す
    int upper_bound(LL x){
        int l = -1, r = (int)bit.size();
        while(r - l > 1){
            int mid = (l + r)/2;
            if(sum_open(mid) <= x){
                l = mid;
            }else{
                r = mid;
            }
        }
        return r;
    }
};
 
int Q;
LL q[202020][3];
vector<LL> v;
map<LL, int> mp;
 
int main(){
    cin >> Q;
    REP(i, Q){
        cin >> q[i][0];
        if(q[i][0] == 1){
            cin >> q[i][1] >> q[i][2];
            v.emplace_back(q[i][1]);
        }
    }
    sort(ALL(v));
    UNIQUE(v);
    REP(i, (int)v.size()){
        mp[v[i]] = i;
    }
    BIT calcidx(202020), calcsum(202020);
    LL b = 0;
    LL cnt = 0;
    REP(i, Q){
        if(q[i][0] == 1){
            calcidx.add(mp[q[i][1]], 1);
            calcsum.add(mp[q[i][1]], q[i][1]);
            b += q[i][2];
            cnt++;
        }else{
            int idx = calcidx.lower_bound((cnt+1)/2);
            LL ans1 = v[idx];
            LL ans2 = calcidx.sum_open(idx)*v[idx] - calcsum.sum_open(idx) + calcsum.sum(idx + 1, 202020) - calcidx.sum(idx + 1, 202020)*v[idx];
            if((int)v.size() >= 2 && idx < (int)v.size() - 1 && ans2 > (calcidx.sum_open(idx + 1)*v[idx + 1] - calcsum.sum_open(idx + 1) + calcsum.sum(idx + 2, 202020) - calcidx.sum(idx + 2, 202020)*v[idx + 1])){
                ans1 = v[idx + 1];
                ans2 = calcidx.sum_open(idx + 1)*v[idx + 1] - calcsum.sum_open(idx + 1) + calcsum.sum(idx + 2, 202020) - calcidx.sum(idx + 2, 202020)*v[idx + 1];
            }
            cout << ans1 << " " << ans2 + b << endl;
        }
    }
}

Measured memory_bytes: 17524