codeforces@281 B

shui

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=;
int numa[maxn],numb[maxn];
long long suma,sumb;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int etc;
        int la=,lb=,last;
        suma=;sumb=;
        for(int i=;i<n;i++){
            scanf("%d",&etc);
            if(etc>=)
                {
                    numa[la++]=etc;
                    suma+=etc;
                }
            else{
                numb[lb++]=-etc;
                sumb+=-etc;
                }
            if(i==n-){
                if(etc>=) last=;
                else last=;
            }
        }
        int state=-;
        for(int i=;state==-&&i<la&&i<lb;i++){
            if(numa[i]>numb[i])
                state=;
            if(numa[i]<numb[i])
                state=;
            }
        if(state==-){
            if(la>lb) state=;
            if(la<lb) state=;
        }
        if(suma>sumb) printf("first\n");
        else if(suma<sumb) printf("second\n");
        else{
            if(state==) printf("first\n");
            else if(state==) printf("second\n");
            else{
                if(last==) printf("first\n");
                else printf("second\n");
            }
        }
    }
    return ;
}