using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;

namespace AtCorder
{
    class Program
    {
        static void Main(string[] args)
        {
            new Program().Solve(new ConsoleInput(Console.In, ' '));
        }
        public void Solve(ConsoleInput cin)
        {
            var N = cin.ReadInt;
            var Node = new List<int>[N];
            for (int i = 0; i < N; i++)
            {
                Node[i] = new List<int>();
            }
            for (int i = 0; i < N - 1; i++)
            {
                var a = cin.ReadInt;
                var b = cin.ReadInt;
                Node[a - 1].Add(b);
                Node[b - 1].Add(a);
            }
            var from1 = new int[N];
            var Q = new Queue<int>();
            var flag = new bool[N];
            Q.Enqueue(1);
            flag[0] = true;
            Q.Enqueue(0);
            var deep = 0;
            while (true)
            {
                var now = Q.Dequeue();
                if (now == 0)
                {
                    if (Q.Count == 0) break;
                    deep++;
                    Q.Enqueue(0);
                    continue;
                }
                from1[now - 1] = deep;
                flag[now - 1] = true;
                var size = Node[now - 1].Count;
                for (int i = 0; i < size; i++)
                {
                    if (!flag[Node[now - 1][i] - 1])
                    {
                        Q.Enqueue(Node[now - 1][i]);
                    }
                }
            }
            Q.Clear();
            var fromN = new int[N];
            for (int i = 0; i < N; i++)
            {
                flag[i] = false;
            }
            Q.Enqueue(N);
            flag[N - 1] = true;
            Q.Enqueue(0);
            deep = 0;
            while (true)
            {
                var now = Q.Dequeue();
                if (now == 0)
                {
                    if (Q.Count == 0) break;
                    deep++;
                    Q.Enqueue(0);
                    continue;
                }
                fromN[now - 1] = deep;
                flag[now - 1] = true;
                var size = Node[now - 1].Count;
                for (int i = 0; i < size; i++)
                {
                    if (!flag[Node[now - 1][i] - 1])
                    {
                        Q.Enqueue(Node[now - 1][i]);
                    }
                }
            }
            var black = 0;
            var white = 0;
            for (int i = 0; i < N; i++)
            {
                if (from1[i] <= fromN[i])
                {
                    black++;
                }
                else
                {
                    white++;
                }
            }
            if (black > white)
            {
                WriteLine("Fennec");
            }
            else
            {
                WriteLine("Snuke");
            }
        }

        /*public long C(long n, long r)
        {
            if (r == 0 || r == n) return 1L;
            if (n < r) return 0L;
            long[,] Pascal = new long[n + 1, n + 1];
            Pascal[0, 0] = 1;
            for (long i = 1; i <= n; i++)
            {
                Pascal[i, 0] = 1;
                Pascal[i, i] = 1;
                for (long j = 1; j < n; j++)
                {
                    Pascal[i, j] = Pascal[i - 1, j] + Pascal[i - 1, j - 1];
                }
            }
            return Pascal[n, r];
        }*/

        public class ConsoleInput
        {
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;
            public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
            {
                this._separator = separator;
                this._stream = stream;
                inputStream = new Queue<string>();
            }
            public string Read
            {
                get
                {
                    if (inputStream.Count != 0) return inputStream.Dequeue();
                    string[] tmp = _stream.ReadLine().Split(_separator);
                    for (int i = 0; i < tmp.Length; ++i)
                        inputStream.Enqueue(tmp[i]);
                    return inputStream.Dequeue();
                }
            }
            public string ReadLine { get { return _stream.ReadLine(); } }
            public int ReadInt { get { return int.Parse(Read); } }
            public long ReadLong { get { return long.Parse(Read); } }
            public double ReadDouble { get { return double.Parse(Read); } }
            public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
            public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
            public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
        }
    }
}


Measured memory_bytes: 29324