import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int n;
    scan(n);
    auto adj = new int[][](n, 0);

    foreach (i ; 0 .. n - 1) {
        int ai, bi;
        scan(ai, bi);
        ai--, bi--;
        adj[ai] ~= bi;
        adj[bi] ~= ai;
    }

    auto c = new int[](n);
    auto d = new int[](n);
    auto p = new int[](n);

    void dfs(int v, int par) {
        p[v] = par;
        c[v] = 1;

        foreach (u ; adj[v]) {
            if (u == par) continue;
            d[u] = d[v] + 1;
            dfs(u, v);
            c[v] += c[u];
        }
    }

    dfs(0, 0);

    int u = n - 1;

    foreach (i ; 0 .. (d[n - 1] + 1) / 2 - 1) {
        u = p[u];
    }

    debug {
        writeln(c);
        writeln(d);
        writeln(p);
        writeln(u);
    }

    auto ans = 2*c[u] >= n ? "Snuke" : "Fennec";
    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
