#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define SZ(x) ((int) (x).size())
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << "[" << #x << " = " << (x) << "]" << endl
#define left __left
#define right __right
#define prev __prev
#define fi first
#define se second
template <class X, class Y>
bool maximize(X &x, Y y) {
if (x < y) return x = y, true;
else return false;
}
template <class X, class Y>
bool minimize(X &x, Y y) {
if (x > y) return x = y, true;
else return false;
}
int numPoke;
int main() {
ios_base::sync_with_stdio(false);cin.tie(nullptr);
cin >> numPoke;
int ans = -1, cnt = 0;
string results = "";
while (numPoke--) {
string namePoke; cin >> namePoke;
int needCandy, numCandy;
cin >> needCandy >> numCandy;
int res = 0;
while (numCandy >= needCandy) {
numCandy -= needCandy - 2;
++res;
}
if (maximize(ans, res)) results = namePoke;
cnt += res;
}
cout << cnt << "\n";
cout << results;
return 0;
}
/* Discipline - Calm */
