#include <bits/stdc++.h>

using namespace std;
const int max_n = 1e5 + 20;
vector<int> adj[max_n];
int barg[max_n];
int n;
int main() {
    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 0; i < n; i++)
        if (adj[i].size() == 1)
            barg[i] = 1;
    for (int i = 0; i < n; i++) {
        int cnt = 0;
        for (auto j : adj[i])
            cnt += barg[j];
        if (cnt - 1 > 0) {
            cout << "FIRST";
            return 0;
        }
    }
    cout << "SECOND";
    return 0;
}
