#[allow(unused_imports)]
use std::char::from_digit;
#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::fs::File;
#[allow(unused_imports)]
use std::io::prelude::*;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufReader, BufWriter, Stdin, Stdout, Write};
#[allow(unused_imports)]
use std::mem::swap;
#[allow(unused_imports)]
use std::str::FromStr;
 
type BoxResult<T> = Result<T, Box<std::error::Error>>;


fn main() {
    let mut scanner = Scanner::new(stdin());
    let n = scanner.read::<usize>().unwrap();
    let mut adj = AdjacencyList::new(n);
    for _ in 0..(n - 1) {
        let line = scanner.read_vector::<usize>().unwrap();
        let (i, j) = (line[0] - 1, line[1] - 1);
        adj.add(i, j);
        adj.add(j, i);
    }
    if judge(&adj) {
        println!("Fennec");
    } else {
        println!("Snuke");
    }
}

fn judge(adj: &AdjacencyList) -> bool {
    let (p_1, p_2) = find_mid(0, adj.len() - 1, adj);
    let count_1 = bfs(0, p_2, adj);
    let count_2 = bfs(adj.len() - 1, p_1, adj);
    count_1 > count_2
}

fn find_mid(src: usize, snk: usize, adj: &AdjacencyList) -> (usize, usize) {
    let mut path_length = 0;
    let mut queue = VecDeque::new();
    let mut used_queue = vec![];
    queue.push_front((src, src, 0));
    while queue.len() > 0 {
        let (crt, prv, len) = queue.pop_back().unwrap();
        used_queue.push((crt, prv, len));
        if crt == snk {
            path_length = len;
            break;
        } 
        for nxt in adj[crt].iter() {
            if *nxt == prv {
                continue;
            }
            queue.push_front((*nxt, crt, len + 1));
        }
    }
    let mut crt = snk;
    let mut first = 0;
    let mut second = 0;
    loop {
        let (c, prv, len) = used_queue.pop().unwrap();
        if c != crt {
            continue;
        }
        if len == path_length / 2 + 1 {
            second = crt;
        }
        if len == path_length / 2 {
            first = crt;
            break;
        }
        crt = prv;
    }
    (first, second)
}


fn bfs(src: usize, target: usize, adj: &AdjacencyList) -> usize {
    let mut count = 0;
    let mut queue = VecDeque::new();
    queue.push_front((src, src, 0));
    while queue.len() > 0 {
        let (crt, prv, len) = queue.pop_back().unwrap();
        if crt == target {
            continue;
        }
        for nxt in adj[crt].iter() {
            if *nxt == prv {
                continue;
            }
            queue.push_front((*nxt, crt, len + 1));
            count += 1;
        }
    }
    count - 1
}

struct AdjacencyList (Vec<Vec<usize>>);

impl AdjacencyList {
    fn new(n: usize) -> Self {
        AdjacencyList(vec![vec![]; n])
    }
    fn add(&mut self, i: usize, j: usize) {
        self.0[i].push(j);
    }
    fn len(&self) -> usize {
        self.0.len()
    }
}

impl std::ops::Index<usize> for AdjacencyList {
    type Output = Vec<usize>;
    fn index(&self, i: usize) -> &Self::Output {
        &self.0[i]
    }
}

#[allow(dead_code)]
struct Scanner<R> {
    reader: BufReader<R>,
    buffer: String,
}
impl<R> Scanner<R>
where
    R: Read,
{
    #[allow(dead_code)]
    fn new(inner: R) -> Scanner<R> {
        let reader = BufReader::new(inner);
        let buffer = String::new();
        Scanner {
            reader: reader,
            buffer: buffer,
        }
    }
    #[allow(dead_code)]
    fn with_capacity(capacity: usize, inner: R) -> Scanner<R> {
        let reader = BufReader::with_capacity(capacity, inner);
        let buffer = String::new();
        Scanner {
            reader: reader,
            buffer: buffer,
        }
    }
 
    #[allow(dead_code)]
    fn read_line(&mut self) -> BoxResult<String> {
        self.reader.read_line(&mut self.buffer)?;
        let cloned = self.buffer.trim().to_string();
        self.buffer.clear();
        Ok(cloned)
    }
 
    #[allow(dead_code)]
    fn read<T>(&mut self) -> BoxResult<T>
    where
        T: FromStr,
        T::Err: std::fmt::Debug,
        T::Err: std::error::Error,
        T::Err: 'static,
    {
        self.reader.read_line(&mut self.buffer)?;
        let parsed = self.buffer.trim().parse()?;
        self.buffer.clear();
        Ok(parsed)
    }
    #[allow(dead_code)]
    fn read_vector<T>(&mut self) -> BoxResult<Vec<T>>
    where
        T: FromStr,
        T::Err: std::fmt::Debug,
        T::Err: std::error::Error,
        T::Err: 'static,
    {
        self.reader.read_line(&mut self.buffer)?;
        let parsed_vec = self
            .buffer
            .trim()
            .split_whitespace()
            .map(|s| s.parse())
            .collect::<Result<Vec<_>, _>>()?;
        self.buffer.clear();
        Ok(parsed_vec)
    }
    #[allow(dead_code)]
    fn read_matrix<T>(&mut self, lines: usize) -> BoxResult<Vec<Vec<T>>>
    where
        T: FromStr,
        T::Err: std::fmt::Debug,
        T::Err: std::error::Error,
        T::Err: 'static,
    {
        let mut parsed_matrix = vec![];
        for _ in 0..lines {
            self.reader.read_line(&mut self.buffer)?;
            parsed_matrix.push(
                self.buffer
                    .trim()
                    .split_whitespace()
                    .map(|s| s.parse())
                    .collect::<Result<Vec<_>, _>>()?,
            );
            self.buffer.clear();
        }
        Ok(parsed_matrix)
    }
    #[allow(dead_code)]
    fn read_chars(&mut self) -> BoxResult<Vec<char>> {
        self.reader.read_line(&mut self.buffer)?;
        let chars = self.buffer.trim().chars().collect::<Vec<_>>();
        self.buffer.clear();
        Ok(chars)
    }
}

Measured memory_bytes: 18684