//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
   
//#include <x86intrin.h>
#include <bits/stdc++.h>   
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;

template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
     
#define F first
#define S second           
#define lb lower_bound               
#define ub upper_bound
#define pb push_back
#define pf push_front    
#define ppb pop_back
#define mp make_pair                                     
#define bpp __builtin_popcountll                                                                                        
#define sqr(x) ((x) * (x)) 
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
//#define int long long
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
 
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;

const double pi = acos (-1.0);
const double eps = 1e-7;                  
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};

int q, m, type[N], a[N], b[N];
ll cnt[N], t[N], sum;
vector <ll> v;

inline ll get_sum (int x) {
   ll ans = 0;
   for (;x > 0;x = (x & (x + 1)) - 1) 
      ans += t[x];
   return ans;
}

inline ll get_cnt (int x) {
   ll ans = 0;
   for (;x > 0; x = (x & (x + 1)) - 1)
      ans += cnt[x];
   return ans;
}

void upd (int pos, int val) {
   for (;pos <= m; pos = (pos | (pos + 1)))
      t[pos] += val, cnt[pos] ++;
}

inline ll f (int x) {
   ll res = 0;
   res += get_cnt (x) * v[x] - get_sum (x);
   res += (get_sum (m) - get_sum (x)) - v[x] * (get_cnt (m) - get_cnt (x));
   return res;

}

inline void boost () {                    
   ios_base :: sync_with_stdio (NULL);
   cin.tie (NULL), cout.tie (NULL);          
}                                                     

inline void Solve () {
   cin >> q;
   for (int i = 1; i <= q; i ++) {
      cin >> type[i];
      if (type[i] == 1) cin >> a[i] >> b[i], v.pb (a[i]);
   }
   sort (all (v));
   v.resize (unique (all (v)) - v.begin ());
   m = sz (v) - 1;
   for (int i = 1; i <= q; i ++) {
      if (type[i] == 1) {
         int p = lb (all (v), a[i]) - v.begin ();
         upd (p, a[i]);
         sum += b[i];
      }
      else {
         int l = 0, r = m;
         while (r - l > 100) {
            int mid = l + r >> 1;
            if (f (mid) <= f (mid + 1)) r = mid;
            else l = mid;
         }
         ll ans = inf;
         int id = -1;
         for (int j = l; j <= r; j ++) {
            ll kol = f (j);
            if (ans > kol) ans = kol, id = j;
         }
         cout << v[id] << ' ' << ans + sum << endl;
      }
   }
}

main () {                                       
// freopen (".in", "r", stdin);    
// freopen (".out", "w", stdout);              
   boost ();
   int tt = 1;
   //cin >> tt;   
   while (tt --) {
      Solve ();
   }                                               
   return 0;      
}
                          

Measured memory_bytes: 10484