#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
//classes
//global
int n, m;
string s;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//stop
int n;
cin >> n;
string name;
ll mx = 0;
ll total = 0;
for(int i = 0; i < n; i++){
string pkmn;
ll need, have;
cin >> pkmn >> need >> have;
int ans = 0;
while(have >= need){
ans++;
have = have -need +2;
}
if(ans > mx){
mx = ans;
name = pkmn;
}
total += ans;
}
cout << total << '\n';
cout << name << '\n';
return 0;
}
