#include <bits/stdc++.h>
using namespace std;
bool isprime(int n) {
  if (n == 1) return false;
  if (n == 2) return true;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
void answer(int f) {
  if (f) {
    cout << "YES";
  } else {
    cout << "NO";
  }
  cout << endl;
}
long long int countSetBits(long long int n) {
  long long int count = 0;
  while (n) {
    count += 1;
    n = n / 10;
  }
  return count;
}
long long int factorial(long long int n) {
  n = n % 1000000007;
  return (n == 1 || n == 0 || n < 0) ? 1 : n * factorial(n - 1);
}
long long int ncp(long long int n, long long int p) {
  long long int a = factorial(n);
  long long int b = factorial(p);
  long long int c = factorial(n - p);
  return (a / (b * c));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) {
    long long int n, m;
    cin >> n;
    long long int i, c[n];
    vector<long long int> a, b;
    long long int sum1 = 0, sum2 = 0;
    for (i = 0; i < n; i++) {
      cin >> c[i];
      if (c[i] > 0) {
        sum1 += c[i];
        a.push_back(c[i]);
      } else {
        long long int df = abs(c[i]);
        sum2 += df;
        b.push_back(df);
      }
    }
    if (sum1 > sum2) {
      cout << "first";
      return 0;
    } else if (sum1 < sum2) {
      cout << "second";
      return 0;
    }
    i = 0;
    int x = min(a.size(), b.size());
    while (i < x) {
      if (a[i] < b[i]) {
        cout << "second";
        return 0;
      } else if (a[i] > b[i]) {
        cout << "first";
        return 0;
      }
      i++;
    }
    if (c[n - 1] < 0)
      cout << "second";
    else
      cout << "first";
  }
  return 0;
}
