import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto G = new long[][](N);
    foreach (i; 0 .. N - 1)
    {
        long a, b;
        scan(a, b);
        a--, b--;
        G[a] ~= b;
        G[b] ~= a;
    }
    auto d0 = new long[](N);
    d0[] = -1;
    auto d1 = new long[](N);
    d1[] = -1;
    alias Tup = Tuple!(long, long);
    PQueue!Tup PQ;
    {
        PQ.insert(Tup(0, 0));
        while (!PQ.empty)
        {
            auto t = PQ.front;
            PQ.removeFront();
            if (d0[t[1]] != -1)
                continue;
            d0[t[1]] = t[0];
            foreach (v; G[t[1]])
                PQ.insert(Tup(t[0] + 1, v));
        }
    }
    {
        PQ.insert(Tup(0, N - 1));
        while (!PQ.empty)
        {
            auto t = PQ.front;
            PQ.removeFront();
            if (d1[t[1]] != -1)
                continue;
            d1[t[1]] = t[0];
            foreach (v; G[t[1]])
                PQ.insert(Tup(t[0] + 1, v));
        }
    }
    long cnt;
    foreach (i; 0 .. N)
    {
        if (d0[i] < d1[i])
            cnt++;
        else
            cnt--;
    }
    writeln((cnt < 0) ? "Fenec" : "Snuke");
}
