#include<bits/stdc++.h> #include<string> using namespace std; struct qm{ string ss; int y; int s; int e; }a[10010]; int main() { int n; cin>>n; int z[n],zz[n]; for(int i=1;i<=n;++i){ cin>>a[i].ss>>a[i].y>>a[i].s>>a[i].e; z[i-1]=a[i].y+a[i].s+a[i].e; zz[i-1]=z[i-1]; } sort(z,z+n); for(int i=0;i<n;++i){ if(zz[i]==z[n-1]){ cout<<a[i+1].ss<<" "; cout<<a[i+1].y<<" "; cout<<a[i+1].s<<" "; cout<<a[i+1].e<<" "; break; } } return 0; }