「CF493B」Vasya and Wrestling

2014年12月4日2,7100

Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins.

When the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins.

If the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won.

Input

The first line contains number n — the number of techniques that the wrestlers have used (1 ≤ n ≤ 2·105).

The following n lines contain integer numbers ai (|ai| ≤ 109, ai ≠ 0). If ai is positive, that means that the first wrestler performed the technique that was awarded with ai points. And if ai is negative, that means that the second wrestler performed the technique that was awarded with ( - ai) points.

The techniques are given in chronological order.

Output

If the first wrestler wins, print string “first“, otherwise print “second”

Sample test(s)
input

output

input

output

input

output

Note

Sequence x  =  x1x2… x|x| is lexicographically larger than sequence y  =  y1y2… y|y|, if either |x|  >  |y| and x1  =  y1,  x2  =  y2, … ,  x|y|  =  y|y|, or there is such number r (r  <  |x|, r  <  |y|), that x1  =  y1,  x2  =  y2,  … ,  xr  =  yr and xr  +  1  >  yr  +  1.

We use notation |a| to denote length of sequence a.

 

题解

先判断和的符号

再比较字典序，用两个指针从左往右扫

 

avatar
  Subscribe  
提醒