#pragma once
#include <stdio.h>
#include <sstream>
#include <string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <limits>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define bit(x,v) ((ll)x << v)

const ll INF = 1000000007;
const ll MAX = 1000010;
const ll MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

// 二項係数計算
long long COM(int n, int k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
	for (size_t i = 0; i <= n; i++)
	{
		pr[i] = i;
	}
}

int parent(int x) {
	if (x == pr[x]) return x;
	return pr[x] = parent(pr[x]);
}

bool unit(int x, int y) {
	int px = parent(x);
	int py = parent(y);

	if (px == py) return false;
	if (px < py) {
		pr[py] = px;
	}
	else {
		pr[px] = py;
	}
	return true;
}

// res[i][c] := i 文字目以降で最初に文字 c が登場する index (存在しないときは n)
vector<vector<int> > calcNext(const string & S) {
	int n = (int)S.size();
	vector<vector<int> > res(n + 1, vector<int>(26, n));
	for (int i = n - 1; i >= 0; --i) {
		for (int j = 0; j < 26; ++j) res[i][j] = res[i + 1][j];
		res[i][S[i] - 'a'] = i;
	}
	return res;
}
// mod 1000000007 の世界で a += b する関数
void add(long long& a, long long b) {
	a += b;
	if (a >= MOD) a -= MOD;
}
const ll ainf = 998244353;

struct cell {
	int x, y;
	int deep;
	cell(int x, int y, int deep) : x(x), y(y), deep(deep) {}
};

int dx[] = { -1,1,0,0 };
int dy[] = { 0,0,-1,1 };

int W, H, N;
int X1[500], X2[500], Y1[500], Y2[500];

bool fld[500 * 6][500 * 6];
int compress(int* x1, int* x2, int w) {
	vector<int> xs;
	for (int i = 0; i < N; i++)
	{
		for (int d = -1; d <= 1; d++)
		{
			int tx1 = x1[i] + d, tx2 = x2[i] + d;
			if (1 <= tx1 && tx1 <= W) xs.push_back(tx1);
			if (1 <= tx2 && tx2 <= W) xs.push_back(tx2);
		}
	}

	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());

	for (size_t i = 0; i < N; i++)
	{
		x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
		x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
	}
	return xs.size();
}
const int MAX_N = 1 << 17;
//
//int n,dat[2 * MAX_N - 1];
//
//void init(int n_) {
//	n = 1;
//	while (n < n_)
//	{
//		n *= 2;
//	}
//	for (size_t i = 0; i < 2 * n - 1; i++)
//	{
//		dat[i] = INT_MAX;
//	}
//}
//
//void update(int k, int a) {
//	k += n - 1;
//	dat[k] = a;
//	while (k > 0) {
//		k = (k - 1) / 2;
//		dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
//	}
//}
//int query(int a, int b, int k, int l, int r) {
//	if (r <= a || b <= 1) return INT_MAX;
//
//	if (a <= l && r <= b) return dat[k];
//	else {
//		int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
//		int vr = query(a, b, k * 2 + 1, (l + r) / 2, r);
//		return min(vl, vr);
//	}
//	
//	auto p = tie(a,b,k);
//}
ll fmemo[1000010];
ll fact(ll x) {
	if (fmemo[x] > 0) return fmemo[x];
	if (x == 0) return 1;
	fmemo[x] = (x * fact(x - 1));
	fmemo[x] %= INF;
	return fmemo[x];
}
priority_queue<ll> m1;
priority_queue<ll, vector<ll>, greater<ll>> m2;

void solv() {

	ll q;
	cin >> q;
	set<ll> a;
	ll b = 0;
	ll v = 0;
	vector<string> res;
	ll va1 = 0;
	ll va2 = 0;
	for (size_t i = 0; i < q; i++)
	{
		ll q1;
		cin >> q1;
		if (q1 == 1) {
			ll v1, v2;
			cin >> v1 >> v2;
			b += v2;
			if (m1.empty()) {
				m1.push(v1);
				va1 += v1;
			}
			else if (v1 <= m1.top()) {
				if (v1 < m1.top()) {
					v += abs(m1.top() - v1);
				}
				if (m1.size() > m2.size()) {
					m2.push(m1.top());
					va1 -= m1.top();
					va2 += m1.top();
					m1.pop();
				}
				m1.push(v1);
				va1 += v1;
			}
			else if (m2.empty()) {
				m2.push(v1);
				v += abs(m1.top() - v1);
				va2 += v1;
			}
			else if (v1 >= m2.top()) {
				if (v1 > m2.top()) {
					if (m2.size() < m1.size()) {
						v += abs(m1.top() - v1);
					}
					else {
						v += abs(m2.top() - v1);
					}
				}
				else {
					v += abs(m1.top() - v1);
				}

				if (m1.size() == m2.size()) {					
					m1.push(m2.top());
					va2 -= m2.top();
					va1 += m2.top();
					m2.pop();
				}
				m2.push(v1);
				va2 += v1;
			}
			else {
				if (m1.size() == m2.size()) {
					m1.push(v1);
					va1 += v1;
				}
				else {
					m2.push(v1);
					va2 += v1;
				}
			}

		}
		else {
			// med
			ll ans = (m1.top() * m1.size()) - va1;
			ans += va2 - (m1.top() * m2.size());
			ans += b;
			res.push_back(to_string(m1.top()) + " " + to_string(ans));
			// res.push_back(to_string(m1.top()) + " " + to_string(v + b));
		}
	}

	for (size_t i = 0; i < res.size(); i++)
	{
		cout << res[i] << endl;
	}

}

int main() {
	//COMinit();
	solv();

	return 0;
}


Measured memory_bytes: 12272