// Created by AboAbdoMC
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) for(int i=a;i>=(n);--i)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const int OO = 1e9+7;
const int MOD = 1e9+7;
const int N = 70+7;
string name[N];
int ans[N];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
rep(i,n)
{
cin >> name[i];
int k,m;
cin >> k >> m;
int tmp = 0;
while(m/k != 0)
{
tmp = m/k;
m -= tmp*k;
m += tmp*2;
ans[i] += tmp;
}
}
int res = 0;
int maxx = 0;
int id = 0;
rep(i,n)
{
res += ans[i];
if (maxx < ans[i])
{
maxx = ans[i];
id = i;
}
}
cout << res << '\n';
cout << name[id] << '\n';
return 0;
}
