#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n][4];
  for (int i = 0; i < n; i++) {
    cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3];
  }
  int sum[n];
  int tot = 0;
  for (int i = 0; i < n; i++) {
    sum[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    tot = 0;
    for (int j = 0; j < 4; j++) {
      tot = tot + a[i][j];
    }
    sum[i] = tot;
  }
  int thomus = sum[0];
  int result;
  sort(sum, sum + n, greater<int>());
  for (int i = 0; i < n; i++) {
    if (thomus == sum[i]) {
      result = i + 1;
      break;
    }
  }
  cout << result << endl;
}
