#include <bits/stdc++.h>

using namespace std;

struct stu {
	int t, v;
};
deque <stu> q;
stack <stu> s;

int main() {
	int n;
	cin >> n;
	int sum = 0;
	for (int i = 1, k, v, t; i <= n; i++) {
		cin >> k >> v >> t; //tool v st
		if (k == 0) {
			sum += v;
			cout << v << " " << sum << endl;
			q.push_back({t, v});
		} else if (k == 1) {
			bool flag = false;
			while (q.size()) {
				stu u = q.front();
				if ((t - u.t) <= 45 && v <= u.v) {
					flag = true;
					q.pop_front();
					while (s.size()) {
						q.push_front(s.top());
						s.pop();
					}
					break;
				} else if ((t - u.t) > 45)
					q.pop_front();
				else {
					s.push(u);
				}

			}
			if (!flag) {
				sum += v;
				cout << v << " " << sum << endl;
				while (s.size()) {
					q.push_front(s.top());
					s.pop();
				}
			}
		}

		if(i==n)cout<<sum;
	}
	return 0;
}