#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//const int INF = 1e9;//INT_MAX=1<<31-1=2147483647
const ll INF = (ll)1e18;//1<<63-1=9223372036854775807
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define pb push_back
inline bool isnatural(double a) { return a>=0 && ceil(a)==floor(a); }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

const ll Q_MAX = 2;
const ll B_MAX = 1000000000;

ll Q;


void input() {
	scanf("%lld", &Q);
}

void solve() {
	vector<ll> a;
	ll b=0;
	ll sum=0;
	ll size=0;
	ll que1sum=0;
	ll que2sum=0;
	priority_queue<ll> que1;
	priority_queue<ll, vector<ll>, function<bool(ll,ll)>>que2(
		[](const ll &x, const ll &y){
			return x > y;
		}
	);	
	
	rep(i,Q){
		ll q;
		cin >> q;
		if(q==1){
			ll aa,bb;
			cin>>aa>>bb;
			sum+=aa;
			b+=bb;
			size++;
			if(size==1){
				que1.push(aa);
				que1sum=aa;
				continue;
			}
			if(size==2){
				ll q1=que1.top();
				if(q1<aa){
					que2.push(aa);
					que1sum=q1;
					que2sum=aa;
				}else{
					que2.push(q1);
					que1.pop();
					que1.push(aa);
					que1sum=aa;
					que2sum=q1;
				}
				continue;
			}
			if(que1.size()==que2.size()){
				ll q2=que2.top();
				if(q2<aa){
					que1.push(q2);
					que2.pop();
					que2.push(aa);
					que1sum+=q2;
					que2sum+=aa-q2;
				}else{
					que1.push(aa);
					que1sum+=aa;
				}
			}else{
				ll q1=que1.top();
				if(q1<aa){
					que2.push(aa);
					que2sum+=aa;
				}else{
					ll q1=que1.top();
					que2.push(q1);
					que1.pop();
					que1.push(aa);
					que1sum+=aa-q1;
					que2sum+=q1;
				}
			}
		}else{
			ll center=que1.top();
			ll ans=b;
			ans+=center*que1.size()-que1sum;
			ans+=que2sum-center*que2.size();
			printf("%lld %lld\n",center,ans);
		}
	}
}

signed main() {
	input();
	solve();
	return 0;
}


Measured memory_bytes: 3828