import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

const long p = 1_000_000_000 + 7;

void main(){
    auto n = readLong();
    auto g = new long[][](n,0);
    foreach(i; iota(n-1)) {
        long a, b;
        readlnTo(a, b);
        --a;
        --b;
        g[a] ~= b;
        g[b] ~= a;
    }
    Tuple!(long, long) dfs(long s, long t, long depth, ref bool[] used) {
        used[s] = true;
        if(s == t) {
            return tuple((depth+1)/2 + 1 == depth ? s: -1, depth);
        }
        foreach(v; g[s]) {
            if(used[v]) {
                continue;
            }
            auto tmp = dfs(v, t, depth+1, used);
            auto tDepth = tmp[1];
            if(tDepth != -1) {
                return tuple((tDepth+1)/2 + 1 == depth ? s: tmp[0], tDepth);
            }
        }
        return tuple(-1L, -1L);
    }
    long size(long x, ref bool[] used) {
        long ans = 1;
        used[x] = true;
        foreach(v; g[x]) {
            if(used[v]) {
                continue;
            }
            ans += size(v, used);
        }
        return ans;
    }

    auto used1 = new bool[](n);
    auto m = dfs(0, n-1, 1, used1)[0];
    auto used2 = new bool[](n);
    used2[m] = true;
    auto b = size(0, used2);
    writeln(b > n-b ? "Fennec": "Snuke");
}

