#include<bits/stdc++.h>
#define f(n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
struct node{
	int score,id;
};
int cmp(node x,node y)
{
	return x.score>y.score;
}
signed main()
{   int n;
    cin>>n;
    node stu[n];
    f(n){
    	int a,b,c,d;
    	cin>>a>>b>>c>>d;
    	stu[i].score=a+b+c+d;
		stu[i].id=i+1; 
	}
	sort(stu,stu+n,cmp);
	f(n)
	{
		if(stu[i].id==1)
		cout<<i+1;
	}
	return 0;
}

开了longlong还不对？？