#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

void dfs(lint node, vec<vec<lint>>& adj, vec<lint>& dist) {
    for (const auto neighbor : adj.at(node)) {
        if (dist.at(neighbor) == -1) {
            dist.at(neighbor) = dist.at(node) + 1;
            dfs(neighbor, adj, dist);
        }
    }
    return;
}

// bool traverse_nodes_in_between(lint node, vec<vec<lint>>& adj, vec<bool>& is_in_between) {
//     for (const lint nei : adj.at(node)) {
//         if (nei == adj.size() - 1) return true;
//         else if (traverse_nodes_in_between(nei, adj, is_in_between)) {
//             is_in_between.at(nei) = 
//         }
//     }
// }

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    lint N;
    cin >> N;
    vec<vec<lint>> adj(N, vec<lint>());
    range(i, 0, N - 1) {
        lint a, b;
        cin >> a >> b;
        a--; b--;
        adj.at(a).emplace_back(b);
        adj.at(b).emplace_back(a);
    }
    vec<lint> dist_from_broot(N, -1), dist_from_wroot(N, -1);
    dist_from_broot.at(0) = 0;
    dist_from_wroot.at(N - 1) = 0;
    dfs(0, adj, dist_from_broot);
    dfs(N - 1, adj, dist_from_wroot);
    lint black_territory = 0, white_territory = 0;
    range(i, 0, N) {
        lint db = dist_from_broot.at(i);
        lint dw = dist_from_wroot.at(i);
        if (db <= dw) black_territory += 1;
        else white_territory += 1;
    }
    bool fennec_wins = black_territory > white_territory;
    cout << (fennec_wins ? "Fennec" : "Snuke") << "\n";
}

Measured memory_bytes: 13568