#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <complex>
#include <functional>
#include <tuple>

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using namespace std;

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
    template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }
    template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t sz;
        inp(std::size_t _sz = 1) : sz(_sz) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }
    };

    // 2次元用の標準入出力
    template<typename T>
    struct inpn {
        std::size_t szi, szj;
        inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}
        operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i)
                for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j];
            return a;
        }
    };

    inp inp1; // input one

    int dp[15][15][15][15];

    int solve(int a, int b, int c, int d) {
        if (dp[a][b][c][d] >= 0) return dp[a][b][c][d];
        
        int& val = dp[a][b][c][d];
 
        Rep(bit, 1, 1 << 4) {
            if ((bit >> 0 & 1) and a == 0) continue;
            if ((bit >> 1 & 1) and b == 0) continue;
            if ((bit >> 2 & 1) and c == 0) continue;
            if ((bit >> 3 & 1) and d == 0) continue;

            int ta = a, tb = b, tc = c, td = d;

            if (bit >> 0 & 1) --ta;
            if (bit >> 1 & 1) --tb;
            if (bit >> 2 & 1) --tc;
            if (bit >> 3 & 1) --td;

            // 一つでも相手が負けになる手があったら勝ち
            if (solve(ta, tb, tc, td) == 0) return val = 1;
        }
        // 何をやっても勝てない
        return val = 0;
    }
}


int main() {

    int n = inp1;
    vector<ll> a = inp(n);

    //const int kMax = 5;
    //rep(i, kMax) {
    //    rep(j, kMax) {
    //        rep(k, kMax) {
    //            rep(l, kMax) {
    //                dp[i][j][k][l] = -1;
    //            }
    //        }
    //    }
    //}

    //Rep(i, 1, kMax) {
    //    Rep(j, i, kMax) {
    //        Rep(k, j, kMax) {
    //            Rep(l, k, kMax) {
    //                int v = solve(i, j, k, l);
    //                cout << i << " " << j << " " << k << " " << l << " ";
    //                if (v == 1) cout << "win" << endl;
    //                else cout << "lose" << endl;
    //            }
    //        }
    //    }
    //}

    // すべて偶数の時負けってのがわかった
    bool lose = true;
    rep(i, n) if (a[i] % 2 != 0) {lose = false;  break;}

    if (lose) Cout("second");
    else Cout("first");

    return 0;
}

Measured memory_bytes: 1024