#include <bits/stdc++.h>   using namespace std;   int main() {     vector<int> b1, b2;     int n;     cin >> n;     int a[n];     long long s1 = 0, s2 = 0;     for (int i = 0; i < n; i++) {       cin >> a[i];       if (a[i] > 0) {         s1 += a[i];         b1.push_back(a[i]);       } else {         s2 -= a[i];         b2.push_back(-a[i]);       }     }     if (s1 > s2) {       cout <<  first ;       return 0;     }     if (s1 < s2) {       cout <<  second ;       return 0;     }     for (int i = 0; i < min(b1.size(), b2.size()); i++) {       if (b1[i] > b2[i]) {         cout <<  first ;         return 0;       }       if (b1[i] < b2[i]) {         cout <<  second ;         return 0;       }     }     if (b1.size() != b2.size()) {       if (b1.size() > b2.size()) {         cout <<  first ;       } else {         cout <<  second ;       }       return 0;     }     for (int i = 0; i < b1.size(); i++) {       if (b1[i] != b2[i]) {         if (b1[i] > b2[i]) {           cout <<  first ;         } else {           cout <<  second ;         }         return 0;       }     }     if (a[n - 1] > 0) {       cout <<  first ;     } else {       cout <<  second ;     }     return 0;   }   