#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
   return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
   os << "[";
   bool a = 1;
   for (auto e : v ) {
      os << (a ? "" : " "); 
      os << e;
      a = 0;
   }
   os << "]";
   return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
   os << "(" << p.first << " " << p.second << ")";
   return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
   os << "{";
   bool a = 1;
   for (auto e : mp) {
      os << (a ? "" : " ");
      os << e.first << ":" << e.second;
      a = 0;
   }
   os << "}";
   return os;
}

// std::tuple Debug
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
   if(N)os<<" ";
   os<<get<N>(t);
   out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
   os<<"(";
   out<0,tuple<Ts...>,Ts...>(os,t);
   os<<")";
   return os;
}

// Debug
#define DUMP(x) cout<<#x<<" = "<<(x)<<endl

struct edge { int to, cost; };

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

template<typename T> struct BIT {
   vector<T> bit;
   int len;
   BIT(int n) : len(n+1), bit(n+1) {}
   void add(int i, T x) {
      i += 1;
      while (i < len) { bit[i] += x; i += i & -i; }
   }
   T sum(int i) {
      i += 1; T s = 0;
      while (i > 0) { s += bit[i]; i -= i & -i; }
      return s;
   }
};

int main()
{
   int Q; cin >> Q;
   vector<int> t(Q), a(Q), b(Q);
   set<int> st;
   for (int i = 0; i < Q; ++i) {
      cin >> t[i];
      if (t[i] == 1) {
         cin >> a[i] >> b[i];
      }
   }

   priority_queue<int> lque;
   priority_queue<int, vector<int>, greater<int>> rque;

   lque.push(-IINF);
   rque.push(IINF);

   LL total_dist = 0;
   LL sumb = 0;

   for (int i = 0; i < Q; ++i)
   {
      if (t[i] == 1)
      {
         sumb += b[i];

         int l = lque.top(), r = rque.top();

         if (l <= a[i] && a[i] <= r) {
            lque.push(a[i]);
            rque.push(a[i]);
         }
         else if (a[i] < l) {
            total_dist += (l - a[i]);
            for (int k = 0; k < 2; ++k) lque.push(a[i]);
            int top = lque.top(); lque.pop();
            rque.push(top);
         }
         else if (a[i] > r) {
            total_dist += (a[i] - r);
            for (int k = 0; k < 2; ++k) rque.push(a[i]);
            int top = rque.top(); rque.pop();
            lque.push(top);
         }
         else {
            assert(false);
         }
      }

      else {
         cout << lque.top() << " " << sumb + total_dist << endl;
      }
   }

   return 0;
}


Measured memory_bytes: 6132