using System;
using System.Collections.Generic;

public class Program
{
    private int N;
    private List<int>[] Edge;

    private int[] Dist;

    public void Solve()
    {
        var sc = new Scanner();
        N = sc.NextInt();
        Edge = new List<int>[N];
        for (int i = 0; i < N; i++)
        {
            Edge[i] = new List<int>();
        }

        for (int i = 0; i < N - 1; i++)
        {
            int a = sc.NextInt() - 1;
            int b = sc.NextInt() - 1;
            Edge[a].Add(b);
            Edge[b].Add(a);
        }

        // 双方の戦略として
        // 相手のところへ最短で行く
        // 自分で塗ったところで枝分かれしてるとこを塗っていく

        // 塗れるところが多いほうが勝ち

        Dist = new int[N];
        for (int i = 0; i < N; i++)
        {
            Dist[i] = int.MaxValue;
        }

        Dist[0] = 0;
        Search(0, -1);

        // 木の境目

        int pos = N - 1;
        int parent = -1;
        while (true)
        {
            foreach (var i in Edge[pos])
            {
                if (Dist[i] + 1 == Dist[pos])
                {
                    parent = pos;
                    pos = i;
                    break;
                }
            }

            if (Dist[pos] == Dist[N - 1] / 2)
            {
                break;
            }
        }

        //Console.WriteLine($"{pos} {parent}");

        int fennec = Count(pos, parent);

        int sunuke = N - fennec;
        Console.WriteLine(fennec > sunuke ? "Fennec" : "Snuke");
    }

    int Count(int i, int parent)
    {
        int ans = 1;
        foreach (int j in Edge[i])
        {
            if (j == parent) continue;
            ans += Count(j, i);
        }

        return ans;
    }

    void Search(int i, int parent)
    {
        foreach (int j in Edge[i])
        {
            if (j == parent) continue;
            Dist[j] = Dist[i] + 1;
            Search(j, i);
        }
    }

    public static void Main(string[] args)
    {
        new Program().Solve();
    }
}

class Scanner
{
    public Scanner()
    {
        _pos = 0;
        _line = new string[0];
    }

    const char Separator = ' ';
    private int _pos;
    private string[] _line;

    #region スペース区切りで取得

    public string Next()
    {
        if (_pos >= _line.Length)
        {
            _line = Console.ReadLine().Split(Separator);
            _pos = 0;
        }

        return _line[_pos++];
    }

    public int NextInt()
    {
        return int.Parse(Next());
    }

    public long NextLong()
    {
        return long.Parse(Next());
    }

    public double NextDouble()
    {
        return double.Parse(Next());
    }

    #endregion

    #region 型変換

    private int[] ToIntArray(string[] array)
    {
        var result = new int[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = int.Parse(array[i]);
        }

        return result;
    }

    private long[] ToLongArray(string[] array)
    {
        var result = new long[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = long.Parse(array[i]);
        }

        return result;
    }

    private double[] ToDoubleArray(string[] array)
    {
        var result = new double[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = double.Parse(array[i]);
        }

        return result;
    }

    #endregion

    #region 配列取得

    public string[] Array()
    {
        if (_pos >= _line.Length)
            _line = Console.ReadLine().Split(Separator);

        _pos = _line.Length;
        return _line;
    }

    public int[] IntArray()
    {
        return ToIntArray(Array());
    }

    public long[] LongArray()
    {
        return ToLongArray(Array());
    }

    public double[] DoubleArray()
    {
        return ToDoubleArray(Array());
    }

    #endregion
}

Measured memory_bytes: 39692