var GET=(function(){function f(s){return new g(s);}function g(s){this._s=s.trim().split("\n");this._y=0;}g.prototype.a=function(f){var s=this._s, y=this._y, r;if(typeof s[y]==="string")s[y]=s[y].split(" ").reverse();r=s[y].pop();if(!s[y].length)this._y++;return f?r:+r;};g.prototype.l=function(f){var s=this._s[this._y++].split(" ");return f?s:s.map(a=>+a);};g.prototype.m=function(n,f){var r=this._s.slice(this._y,this._y+=n).map(a=>a.split(" "));return f?r:r.map(a=>a.map(a=>+a));};g.prototype.r=function(n,f){var r=this._s.slice(this._y,this._y+=n);return f?r:r.map(a=>+a);};return f;})();
var o=GET(require("fs").readFileSync("/dev/stdin","utf8"));
function xArray(v){var a=arguments,l=a.length,r="Array(a["+--l+"]).fill(0).map(x=>{return "+v+";})";while(--l)r="Array(a["+l+"]).fill(0).map(x=>"+r+")";return eval(r);}
function PriorityQueue(){
  this.heap = [];
}
PriorityQueue.prototype = {
  push : function(x){
    var i = this.heap.length++;
    while(i){
      var j = i - 1 >> 1;
      if(this.heap[j] <= x)break;
      this.heap[i] = this.heap[j];
      i = j;
    }
    this.heap[i] = x;
  },
  pop : function(){
    var r = this.heap[0];
    var x = this.heap.pop();
    var i = 0;
    var k = this.heap.length >> 1;
    while (i < k) {
      var j = (i << 1) + 1;
      if(this.heap[j+1] < this.heap[j])++j;
      if(x <= this.heap[j])break;
      this.heap[i] = this.heap[j];
      i = j;
    }
    if(this.heap.length)this.heap[i] = x;
    return r;
  },
  size : function(){return this.heap.length;},
  top : function(){return this.heap[0];},
};
var b = 0;
var low = new PriorityQueue();
var hi = new PriorityQueue();
var cnt = 0;

console.log(main());
function main(){
  var q = o.a();
  var ans = [];
  for(var i = 0; i < q; i++){
    var t = o.l();
    if(t[0] === 2)ans.push((-low.top())+" "+b);
    else solve(t[1],t[2]);
  }
  return ans.join("\n");
}
function solve(u,v){
  b += v;
  var h = hi.top();
  var l = -low.top();
  if(cnt === 0){
    low.push(-u);
  }else if(cnt&1){
    if(l <= u){
      hi.push(u);
    }else{
      hi.push(-low.pop());
      low.push(-u);
    }
    b += Math.abs(u-l);
  }else{
    if(h < u){
      low.push(-hi.pop());
      hi.push(u);
    }else{
      low.push(-u);
    }
    if(u < l)b += (l-u)*cnt;
    else if(h < u)b += (u-h)*cnt;
  }
  cnt++;
}