#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let n = get!(usize);
    let ab = get!(usize, usize;n-1);

    let mut nodes = vec![Vec::new(); n+1];
    for (a,b) in ab {
        nodes[a].push(b);
        nodes[b].push(a);
    }

    let mut queue = VecDeque::new();
    let mut map = BTreeMap::new();
    queue.push_back(1);
    while let Some(node) = queue.pop_front() {
        if node == n {
            break;
        }
        for &next in &nodes[node] {
            if map.contains_key(&next) {
                continue;
            }
            queue.push_back(next);
            map.insert(next, node);
        }
    }
    
    let mut route = VecDeque::new();
    let mut now = n;
    route.push_front(n);
    while let Some(node) = map.get(&now).cloned() {
        route.push_front(node);
        now = node;
        if node == 1 {
            break;
        }
    }

    let rlen = route.len();
    //black
    let mut queue = VecDeque::new();
    let mut visited = BTreeSet::new();
    let mut count = 0;
    for &node in route.iter().take(rlen-rlen/2) {
        queue.push_back(node);
        visited.insert(node);
        count += 1;
    }
    visited.insert(route[rlen-rlen/2]);

    while let Some(node) = queue.pop_front() {
        for &next in &nodes[node] {
            if visited.contains(&next) {
                continue;
            }
            count += 1;
            queue.push_back(next);
            visited.insert(next);
        }
    }

    let black = count;

    //white
    let mut queue = VecDeque::new();
    let mut visited = BTreeSet::new();
    let mut count = 0;
    for &node in route.iter().skip(rlen-rlen/2) {
        queue.push_back(node);
        visited.insert(node);
        count += 1;
    }
    visited.insert(route[rlen-rlen/2-1]);

    while let Some(node) = queue.pop_front() {
        for &next in &nodes[node] {
            if visited.contains(&next) {
                continue;
            }
            count += 1;
            queue.push_back(next);
            visited.insert(next);
        }
    }

    let white = count;

    if black > white {
        println!("Fennec");
    } else {
        println!("Snuke");
    }
}


Measured memory_bytes: 22908