#include <iostream>
#include <algorithm>
#include <cstring>
typedef long long LL;
using namespace std;
const int N = 100010;
int a[N],b[N],c[N],d[N],e[N];
int main ()
{
int n,m;
int res = 0,res1 = 0;
int mid = 0;
while (cin >> n && cin >> m)
{
mid ++;
if (res1 < (n + m) && (n + m) > 8)
{
res1 = (n + m) ;
res = mid;
}
}
cout << res;
return 0;
}