// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
import std.datetime, std.bigint;

int n;
int[][] adj;

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

    int ai, bi;

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

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

    void dfs(int u, int par, int dep) {
        d[u] = dep;
        p[u] = par;

        foreach (v ; adj[u]) {
            if (v != par) {
                dfs(v, u, dep + 1);
            }
        }
    }

    dfs(0, 0, 0);

    int x = (d[n - 1] - 1) / 2;
    int pos = n - 1;

    while (x--) {
        pos = p[pos];
    }

    int dfs2(int u) {
        int res = 1;

        foreach (v ; adj[u]) {
            if (v != p[u]) {
                res += dfs2(v);
            }
        }

        return res;
    }

    int cnt = dfs2(pos);

    if (cnt*2 >= n) {
        writeln("Snuke");
    }
    else {
        writeln("Fennec");
    }
}

void scan(T...)(ref T args) {
    string[] line = readln.split;
    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);
        }
    }
}