#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/multiprecision/cpp_int.hpp>

/***** type *****/
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::cpp_int;

/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define mod 1000000007                           // 1e9 + 7
#define pi 3.14159265                            // 3.14 ...
/***** for each macro *****/
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, v) fori(i, auto& e: v)
#define forir(i, ...) if(ll i = Size(v)) for(__VA_ARGS__) if(i--, true)
#define eachr(i, e, v) forir(i, auto& e: boost::adaptors::reverse(v))

/***** lambda *****/
auto Bit = [] // long long bit shift
(auto n) { return (1LL << n); };
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoLL = []  // char to long long
(auto c) { return (ll)(c - '0'); };
auto Divc = []  // long double div ceiling
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Modify = [] // add vector or sub vector
(auto b, auto e, auto x)
{ for(auto it = b; it != e; ++it) *it += x; };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = []   // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };
auto VVT = []   // vector<vector<T>> resize 
(auto& vvt, auto ysize, auto xsize)
{ vvt.resize(ysize); each(i, vy, vvt) vy.resize(xsize); };
auto VVVT = []   // vector<vector<vector<T>>> resize 
(auto& vvvt, auto zsize, auto ysize, auto xsize)
{ vvvt.resize(zsize); each(z, vz, vvvt) VVT(vz, ysize, xsize); };
auto InVVT = []  // input vector<vector<T>> (T != struct)
(auto& vvt) { each(y, vy, vvt) each(x, e, vy) cin >> e; };
auto InVVVT = [] // input vector<vector<vector<T>>> (T != struct)
(auto& vvvt) { each(z, vz, vvvt) InVVT(vz); };

namespace NyaGadget
{
	/*** 中央値分割ライブラリ ***/

	template <class T> struct MedianSplittingResult
	{
		priority_queue<T> lpq;
		priority_queue<T, vt<T>, greater<T>> rpq;

		vt<T> median;
		vt<T> add_lv;
		vt<T> add_rv;
		vt<T> sub_lv;
		vt<T> sub_rv;
	};

	template <class T> void MedianSplitting
	(T add, MedianSplittingResult<T>& res)
	{
		res.median.clear();
		res.add_lv.clear(); res.add_rv.clear();
		res.sub_lv.clear(); res.sub_rv.clear();
		if (res.lpq.empty())
		{	// 1つめの要素はlpqへ挿入
			res.lpq.push(add);
			res.add_lv.push_back(add);
			res.median.push_back(add);
			return;
		}

		if (Size(res.rpq) < Size(res.lpq))
		{	// Size(rpq)が小さいときだけrpqへの要素挿入を許可
			res.rpq.push(add);
			res.add_rv.push_back(add);
			if (res.rpq.top() < res.lpq.top())
			{	// rpqが小さいのはngなので交換
				ll ltemp = res.lpq.top();
				ll rtemp = res.rpq.top();
				res.lpq.pop(); res.rpq.pop();
				res.sub_lv.push_back(ltemp); res.sub_rv.push_back(rtemp);
				res.lpq.push(rtemp); res.rpq.push(ltemp);
				res.add_lv.push_back(rtemp); res.add_rv.push_back(ltemp);
			}
		}
		else
		{
			res.lpq.push(add);
			res.add_lv.push_back(add);
			if (res.rpq.top() < res.lpq.top())
			{	// rpqが小さいのはngなので交換
				ll ltemp = res.lpq.top();
				ll rtemp = res.rpq.top();
				res.lpq.pop(); res.rpq.pop();
				res.sub_lv.push_back(ltemp); res.sub_rv.push_back(rtemp);
				res.lpq.push(rtemp); res.rpq.push(ltemp);
				res.add_lv.push_back(rtemp); res.add_rv.push_back(ltemp);
			}
		}

		if (Size(res.lpq) != Size(res.rpq))
		{
			res.median.push_back(res.lpq.top());
		}
		else
		{
			res.median.push_back(res.lpq.top());
			res.median.push_back(res.rpq.top());
		}
	}
}

using namespace NyaGadget;

struct Query
{
	ll q = 0;
	ll a = 0;
	ll b = 0;
};

struct Ans
{
	ll x = 0;
	ll sum = 0;
};

int main(void)
{
	ll Q; cin >> Q;
	vt<Query> q(Q);

	ll lsum = 0;
	ll rsum = 0;
	ll bsum = 0;
	vector<Ans> ans;
	MedianSplittingResult<ll> msr;
	each(i, e, q)
	{
		cin >> e.q;
		if (e.q == 1)
		{
			cin >> e.a >> e.b;
			bsum += e.b;

			MedianSplitting<ll>(e.a, msr);
			each(i, e, msr.sub_lv) lsum -= e;
			each(i, e, msr.sub_rv) rsum -= e;
			each(i, e, msr.add_lv) lsum += e;
			each(i, e, msr.add_rv) rsum += e;
		}
		else
		{
			ll x = (Size(msr.median) == 1) ? msr.median[0] : min(msr.median[0], msr.median[1]);
			ll sum = abs(x * Size(msr.lpq) - lsum) + abs(x * Size(msr.rpq) - rsum) + bsum;
			ans.push_back({ x, sum });
		}
	}

	each(i, e, ans) cout << e.x << " " << e.sum << endl;
	return 0;
}



Measured memory_bytes: 10344