玄

#include <bits/stdc++.h>
using namespace std;
using ll=long long;

struct fighter
{
	ll k,d,a,all,num;
}s[100000];
bool cmp(fighter x,fighter y)
{
	return x.all>y.all;
}
int main()
{
 	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
  	ll n;
 	cin>>n;
	for(ll i=0;i<n;i++)
	{
		scanf("%lld/%lld/%lld",&s[i].k,&s[i].d,&s[i].a);
		s[i].num=i;
		if(s[i].k-s[i].d>=10)
		{
			s[i].all=s[i].k*(s[i].k-s[i].d)+s[i].a;
		}
		else if(s[i].k>=s[i].d)
		{
			s[i].all=(s[i].k-s[i].d+1)*3+s[i].a;
		}
		else
		{
			s[i].all=2*s[i].a;
		}
		//cout<<s[i].num<<' '<<s[i].all<<endl;
	}
	sort(s,s+n,cmp);
	cout<<s[0].num+1;
	return 0;
}